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
Discrete Applied Mathematics
New simple constructions of distance-increasing mappings from binary vectors to permutations
Information Processing Letters
Distance-preserving mappings from binary vectors to permutations
IEEE Transactions on Information Theory
On constant-composition codes over Zq
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
Cyclic constructions of distance-preserving maps
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Distance-increasing maps of all lengths by simple mapping algorithms
IEEE Transactions on Information Theory
A Generalized Upper Bound and a Multilevel Construction for Distance-Preserving Mappings
IEEE Transactions on Information Theory
Distance-Preserving and Distance-Increasing Mappings From Ternary Vectors to Permutations
IEEE Transactions on Information Theory
Simple Distance-Preserving Mappings From Ternary Vectors to Permutations
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
A distance-preserving mapping is a one-to-one function f from p-ary vectors of length m to q-ary vectors of length n such that any two distinct p-ary vectors are mapped to two different q-ary vectors with an equal or greater Hamming distance. A special distance-preserving mapping called a distance-increasing mapping is a mapping which increases the distance at least one if the distance of two distinct input strings are not equal to the output length. A constant composition vector is a vector under the restriction that each alphabet symbol occurs a given number of times. In this paper, we propose a distance-increasing mapping from binary vectors to constant composition quaternary vectors. We also give an optimal impossibility result for constructing distance-preserving mapping from binary vectors to constant composition ternary vectors in the so-called swapping model.