Optimal difference systems of sets with multipliers
Document Type
Conference Proceeding
Publication Date
1-1-2006
Department
Department of Mathematical Sciences
Abstract
Difference Systems of Sets (DSS) are combinatorial structures that are used in code synchronization. A DSS is optimal if the associated code has minimum redundancy for the given block length n, alphabet size q, and error-correcting capacity ρ. An algorithm is described for finding optimal DSS that admit prescribed symmetries defined by automorphisms of the cyclic group of order n, together with optimal DSS found by this algorithm.
Publication Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Recommended Citation
Tonchev, V.,
&
Wang, H.
(2006).
Optimal difference systems of sets with multipliers.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
3967 LNCS, 612-618.
http://doi.org/10.1007/11753728_61
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/4001