Optimal difference systems of sets and difference sets

摘要

Difference systems of sets (DSSs) are combinatorial structures that are generalizations of cyclic difference sets and arise in connection with code synchronization. In this paper, we give a recursive construction of DSSs with smaller redundancy from partition-type DSSs and difference sets. As applications, we obtain some new infinite classes of optimal DSSs from the known difference sets and almost difference sets.