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

@article{Chang2006NewAO,
  title={New Algorithms of Distance-Increasing Mappings from Binary Vectors to Permutations by Swaps},
  author={Jen-Chun Chang},
  journal={Designs, Codes and Cryptography},
  year={2006},
  volume={39},
  pages={335-345}
}
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 are useful for the construction of permutation codes (permutation arrays). In this paper, we propose new simpler algorithms of distance-increasing mappings. These algorithms do not need any table lookup operations, and they are built up with fewer swap perations. In the comparison of our new algorithms with other DIMs, we also give some numerical… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-3 OF 3 CITATIONS