Mappings of the set of binary vectors of a fixed length to the set of permutations of the same length, preserving or increasing the Hamming distance, are useful for the construction of permutation arrays. In this paper, explicit constructions of such mappings are given.
|Number of pages||1|
|Journal||IEEE International Symposium on Information Theory - Proceedings|
|State||Published - 20 Oct 2003|
|Event||Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan|
Duration: 29 Jun 2003 → 4 Jul 2003