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.
Difference systems of sets (DSSs) are combinatorial structures that are a generalization of cyclic difference sets and arise in connection with code synchronization. In this correspondence, we give some constructions of DSS from cyclic designs and get some infinite classes of optimal difference systems of sets.