Abstract
Mendelsohn design was first used to construct n − 1 blocks of one optimal 2−(n, n, 2) packing which is isomorphic to an (n, n − 1, n − 1) permutation array. The n-ary shift register (SR) formed by a group of k binary SRs of length n was constructed and then used to operate n − 1 blocks of the 2−(n, n, 2) packing which can generate n(n − 1) blocks of another optimal 2−(n, n, 2n) packing from which a family of (n, n(n − 1), n − 1) permutation codes can be constructed.
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.
