New distance-preserving maps of odd length
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.
hamming distance distance-preserving maps (dpms) permutation arrays