A recursive construction for difference systems of sets
From MaRDI portal
Difference systems of sets (DSSs), which can be used for code synchronization, generalize cyclic difference sets. In this paper, recursive constructions for DSSs with composite order are developed, and infinite series of asymptotically optimal DSSs are given.
Recommendations
Cites work
- Comma-Free Codes
- Difference systems of sets and code synchronization
- scientific article; zbMATH DE number 3478748 (Why is no real title available?)
- scientific article; zbMATH DE number 3252237 (Why is no real title available?)
- Hyperplane partitions and difference systems of sets
- Optimal difference systems of sets and difference sets
- Optimal difference systems of sets and partition-type cyclic difference packings
- Partitions of difference sets and code synchronization
Cited in
(10)- A unifying construction for difference sets
- An algorithm for optimal difference systems of sets
- Computational results for regular difference systems of sets attaining or being close to the Levenshtein bound
- Optimal Difference Systems of Sets with Multipliers
- scientific article; zbMATH DE number 4091487 (Why is no real title available?)
- Relative linking systems of difference sets and linking systems of relative difference sets
- Difference systems of sets and code synchronization
- Some new constructions of difference systems of sets
- Optimal difference systems of sets and difference sets
- Difference systems of sets and cyclotomy
This page was built for publication: A recursive construction for difference systems of sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2414933)