Abstract
A perfect ( v , { | D i | : 0 ≤ i ≤ s − 1 } , ρ ) difference system of sets is a collection of s disjoint subsets D i , 0 ≤ i ≤ s − 1 of Z v , such that every non-zero element of Z v appears exactly ρ times in the multiset { a − b : a ∈ D i , b ∈ D j , 0 ≤ i ≠ j ≤ s − 1 } . In this paper, we give two recursive constructions of perfect DSS s by using the unit group of Z p n , and obtain some infinite classes of perfect DSS s over Z p n .
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
