Abstract
Difference systems of sets (DSSs) are combinatorial structures introduced by Levenshtein in connection with code synchronization. In this paper, some recursive constructions of DSSs obtained from finite projective geometry are presented. As a consequence, new infinite families of optimal DSSs are obtained.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have