Optimal difference systems of sets and difference sets (Q719663): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q592357 |
||
Property / author | |||
Property / author: Jin-Hua Wang / rank | |||
Revision as of 17:06, 19 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal difference systems of sets and difference sets |
scientific article |
Statements
Optimal difference systems of sets and difference sets (English)
0 references
11 October 2011
0 references
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.
0 references
difference systems of sets (DSSs)
0 references
code synchronization
0 references
difference sets
0 references
Levenshtein bound
0 references
Paley-Hadamard difference sets
0 references