(n, n(n − 1), n − 1) Permutation codes based on packing and Mendelsohn designs. Issue 23 (1st November 2016)

• Record Type: Journal Article
• Authors: Peng, Li
• Is Part Of: Electronics letters. Volume 52:Issue 23(2016)
• Page Start: 1916
• Page End: 1918
• Publication Date: 2016-11-01
• Subjects: codes; permutation codes -- Mendelsohn design -- n‐ary shift register; Electronics -- Periodicals; 621.381
• DOI: 10.1049/el.2016.2403
• Languages: English
• ISSNs: 0013-5194

Abstract

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, 2 n ) packing from which a family of ( n, n ( n − 1), n − 1) permutation codes can be constructed.