2006 | OriginalPaper | Chapter
Optimal Difference Systems of Sets with Multipliers
Authors : Vladimir D. Tonchev, Hao Wang
Published in: Computer Science – Theory and Applications
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.