Distance-increasing mappings from binary vectors to permutations

Authors:
Jen-Chun Chang
Affiliations:
Dept. of Comput. Sci. & Inf. Eng., Nat. Taipei Univ.
Venue:
IEEE Transactions on Information Theory
Year:
2005

Citing 0
Cited 7

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

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

Designs, Codes and Cryptography
New simple constructions of distance-increasing mappings from binary vectors to permutations

Information Processing Letters
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
A k-cube graph construction for mappings from binary vectors to permutations

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Permutation sequences and coded PAM signals with spectral nulls at rational submultiples of the symbol frequency

Cryptography and Communications
Constructing Constant Composition Codes via Distance-Increasing Mappings

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	754.84

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 except when that is obviously not possible are useful for the construction of permutation codes. In this correspondence, we propose recursive and explicit constructions of such mappings. Some comparisons show that the new mappings have better distance expansion distributions than other known distance-preserving mappings (DPMs). We also give some examples to illustrate the applications of these mappings to permutation arrays (PAs)