Journal of Combinatorial Optimization
Volume 14, Numbers 2-3, 165-175, DOI: 10.1007/s10878-007-9064-6

An algorithm for optimal difference systems of sets

Vladimir D. Tonchev and Hao Wang

From the issue entitled "Special Issue: Selected Papers from the CTS Conference on Combinatorics and its Applications in Honor of Frank K. Hwang's 65th Birthday; Guest Editors: Gerard J. Chang, Hung-Lin Fu and Xuding Zhu"

View Related Documents

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.

Keywords  Code synchronization - Comma-free code - Cyclic difference set - Difference system of sets

Dedicated to Professor Frank K. Hwang on the occasion of his 65th birthday.
Research supported by NSF Grant CCR-0310632.

Fulltext Preview

Image of the first page of the fulltext document