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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.