New Algorithms of Distance-Increasing Mappings from Binary Vectors to Permutations by Swaps

Authors:
Jen-Chun Chang
Affiliations:
Department of Computer Science and Information Engineering, National Taipei University, Taipei, Taiwan 237
Venue:
Designs, Codes and Cryptography
Year:
2006

Citing 3
Cited 2

Distance-preserving mappings from binary vectors to permutations

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

Visualization

Abstract

Mappings from the set of binary vectors of a fixed length to the set of permutations of the same length that strictly increase Hamming distances are useful for the construction of permutation codes (permutation arrays). In this paper, we propose new simpler algorithms of distance-increasing mappings. These algorithms do not need any table lookup operations, and they are built up with fewer swap perations. In the comparison of our new algorithms with other DIMs, we also give some numerical results to illustrate that the distance expansion distributions of our new mappings are not bad.