New distance-preserving maps of odd length

Authors:
Kwankyu Lee
Affiliations:
Dept. of Math., Sogang Univ., Seoul, South Korea
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 6

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

We propose a new construction of maps preserving the Hamming distance from the set of binary vectors of odd length to the set of permutations of the same length. We investigate their distance increasing property, and show that a class of new maps have better distance increasing property than previously known maps of equal length.