Abstract
Difference systems of sets (DSSs) are combinatorial structures which were introduced by Levenshtein in connection with code synchronization. In this paper, we give some recursive constructions of DSSs by using partition-type cyclic difference packings, and obtain new infinite classes of optimal DSSs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
