Distance-preserving mappings from binary vectors to permutations

Authors:
Jen-Chun Chang;Rong-Jaye Chen;T. Klove;Shi-Chun Tsai
Affiliations:
Dept. of Inf. Manage., Ming Hsin Univ. of Sci. & Technol., Hsin Chu, Taiwan;-;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 13

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
On constant composition codes

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

Information Processing Letters
Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes

Designs, Codes and Cryptography
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
Decoding frequency permutation arrays under infinite norm

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
On constant composition codes

Discrete Applied Mathematics
Decoding frequency permutation arrays under Chebyshev distance

IEEE Transactions on Information Theory
Permutation sequences and coded PAM signals with spectral nulls at rational submultiples of the symbol frequency

Cryptography and Communications
Decoding permutation arrays with ternary vectors

Designs, Codes and Cryptography
Constructing Constant Composition Codes via Distance-Increasing Mappings

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	754.90

Visualization

Abstract

Mappings of the set of binary vectors of a fixed length to the set of permutations of the same length are useful for the construction of permutation codes. In this article, several explicit constructions of such mappings preserving or increasing the Hamming distance are given. Some applications are given to illustrate the usefulness of the construction. In particular, a new lower bound on the maximal size of permutation arrays (PAs) is given.