New simple constructions of distance-increasing mappings from binary vectors to permutations

Authors:
Jyh-Shyan Lin;Jen-Chun Chang;Rong-Jaye Chen
Affiliations:
Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu, Taiwan;Department of Computer Science and Information Engineering, National Taipei University, Taipei County, Taiwan;Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu, Taiwan
Venue:
Information Processing Letters
Year:
2006

Citing 5
Cited 2

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
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

Quantified Score

Hi-index	0.89

Visualization

Abstract

Distance-increasing mappings (DIMs) are mappings from the set of binary vectors of a fixed length to the set of permutations of the same length that increase Hamming distances except when that is obviously not possible. In this paper, we propose new non-recursive constructions of DIMs which are based on simple compositions of permutations. In comparison with Chang's constructions, our new constructions do not need any table-lookup operations, and usually have better distance expansion distributions when the length is odd.