Permutation arrays for powerline communication and mutually orthogonal latin squares

Authors:
C. J. Colbourn;T. Klove;A. C.H. Ling
Affiliations:
Dept. of Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ, USA;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2004

Citing 0
Cited 14

Constructions for Permutation Codes in Powerline Communications

Designs, Codes and Cryptography
A Construction of Optimal Constant Composition Codes

Designs, Codes and Cryptography
On the Construction of Permutation Arrays via Mappings from Binary Vectors to Permutations

Designs, Codes and Cryptography
On constant composition codes

Discrete Applied Mathematics
Constructions of optimal GDRP(n,λ;v)'s of type λ1µm-1

Discrete Applied Mathematics
On constant composition codes

Discrete Applied Mathematics
Bounds on permutation codes of distance four

Journal of Algebraic Combinatorics: An International Journal
Classes of permutation arrays in finite projective spaces

International Journal of Information and Coding Theory
Linear size optimal q-ary constant-weight codes and constant-composition codes

IEEE Transactions on Information Theory
Correcting limited-magnitude errors in the rank-modulation scheme

IEEE Transactions on Information Theory
Combinatorial Designs for Authentication and Secrecy Codes

Foundations and Trends in Communications and Information Theory
Codes in permutations and error correction for rank modulation

IEEE Transactions on Information Theory
A new table of permutation codes

Designs, Codes and Cryptography
Coding with injections

Designs, Codes and Cryptography

Quantified Score

Hi-index	755.02

Visualization

Abstract

We develop a connection between permutation arrays that are used in powerline communication and well-studied combinatorial objects, mutually orthogonal latin squares (MOLS). From this connection, many new results on permutation arrays can be obtained.