Abstract
Difference systems of sets (DSS) are combinatorial configurations that arise in connection with code synchronization. This paper proposes a new method to construct DSSs, which uses known DSSs to partition some of the cosets of Zν relative to subgroup of order k, where ν = km is a composite number. As applications, we obtain some new 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