Upper bounds on permutation codes via linear programming
European Journal of Combinatorics
Constructions for Permutation Codes in Powerline Communications
Designs, Codes and Cryptography
A random construction for permutation codes and the covering radius
Designs, Codes and Cryptography
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Permutation arrays for powerline communication and mutually orthogonal latin squares
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
A permutation code of length n and minimum distance d is a set Γ of permutations from some fixed set of n symbols such that the Hamming distance between any distinct $${u,v \in \Gamma}$$ is at least d. As a generalization, we introduce the problem of packing injections from an m-set, m 驴 n, sometimes called m-arrangements, relative to Hamming distance. We offer some preliminary coding-theoretic bounds, a few design-theoretic connections, and a short discussion on possible applications.