An algorithm for optimal difference systems of sets
Document Type
Article
Publication Date
10-2007
Abstract
Difference Systems of Sets (DSS) are combinatorial structures that generalize cyclic difference sets and 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 for finding optimal DSS is presented together with tables of optimal solutions found by this algorithm.
Publication Title
Journal of Combinatorial Optimization
Recommended Citation
Tonchev, V.,
&
Wang, H.
(2007).
An algorithm for optimal difference systems of sets.
Journal of Combinatorial Optimization,
14(1-2), 165-175.
http://doi.org/10.1007/s10878-007-9064-6
Retrieved from: https://digitalcommons.mtu.edu/math-fp/114
Publisher's Statement
© Springer Science+Business Media, LLC 2007. Publisher’s version of record: https://doi.org/10.1007/s10878-007-9064-6