Abstract
Difference systems of sets (DSS) are combinatorial structures introduced by Levenshtein in 1971, which are a generalization of cyclic difference sets and arise in connection with code synchronization. In this paper, we describe some recursive constructions for DSSs having composite order, and present some infinite series of asymptotically optimal DSSs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
