Upper bounds on permutation codes via linear programming
European Journal of Combinatorics
Constructions of permutation arrays
IEEE Transactions on Information Theory
Distance-preserving mappings from binary vectors to permutations
IEEE Transactions on Information Theory
Two constructions of permutation arrays
IEEE Transactions on Information Theory
Permutation arrays for powerline communication and mutually orthogonal latin squares
IEEE Transactions on Information Theory
New distance-preserving maps of odd length
IEEE Transactions on Information Theory
Distance-increasing mappings from binary vectors to permutations
IEEE Transactions on Information Theory
Distance-increasing mappings from binary vectors to constant composition vectors
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Constructing Constant Composition Codes via Distance-Increasing Mappings
SIAM Journal on Discrete Mathematics
Hi-index | 0.01 |
An (n, d, k)-mapping f is a mapping from binary vectors of length n to permutations of length n + k such that for all x, y $$\in$$ {0,1}n, dH (f(x), f(y)) 驴 dH (x, y) + d, if dH (x, y) 驴 (n + k) 驴 d and dH (f(x), f(y)) = n + k, if dH (x, y) (n + k) 驴 d. In this paper, we construct an (n,3,2)-mapping for any positive integer n 驴 6. An (n, r)-permutation array is a permutation array of length n and any two permutations of which have Hamming distance at least r. Let P(n, r) denote the maximum size of an (n, r)-permutation array and A(n, r) denote the same setting for binary codes. Applying (n,3,2)-mappings to the design of permutation array, we can construct an efficient permutation array (easy to encode and decode) with better code rate than previous results [Chang (2005). IEEE Trans inf theory 51:359---365, Chang et al. (2003). IEEE Trans Inf Theory 49:1054---1059; Huang et al. (submitted)]. More precisely, we obtain that, for n 驴 8, P(n, r) 驴 A(n 驴 2, r 驴 3) A(n 驴 1,r 驴 2) = A(n, r 驴 1) when n is even and P(n, r) 驴 A(n 驴 2, r 驴 3) = A(n 驴 1, r 驴 2) A(n, r 驴 1) when n is odd. This improves the best bound A(n 驴 1,r 驴 2) so far [Huang et al. (submitted)] for n 驴 8.