Optimal difference systems of sets and difference sets (Q719663): Difference between revisions

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, a recursive construction of DSSs with smaller redundancy from partition-type DSSs and difference sets are given, in connection with Paley-Hadamard difference sets. These DSSs satisfy the equality with Levenshtein bound. As applications, some new infinite classes of optimal DSSs from the known difference sets and almost difference sets are obtained. Some examples are given.