Previous | [ 1] | [ 2] | [ 3] | [ 4] | [ 5] | [ 6] | [ 7] | [ 8] | [ 9] | [ 10] | [ 11] | [ 12] | [ 13] | [ 14] | [ 15] | [ 16] | [ 17] | [ 18] | [ 19] | [ 20] | [ 21] |

¡@

**Jen-Chun Chang**

National Taipei University

Taipei, 237 Taiwan

Permutation arrays (PAs, or permutation codes) are useful in communication over power lines. Distance-increasing mappings (DIMs) from the set of binary vectors of a fixed length to the set of permutations of the same length that strictly increase Hamming distances (except when that is obviously not possible) are useful to construct permutation arrays. In this paper, we first give a new recursive construction of DIMs. Next, with a tricky and very different way to use the recursive construction of DIMs, we find a new construction of PAs. Finally, a new lower bound for the size of PAs is given.

*
Keywords:
*
distance-preserving mappings (DPMs), distance-increasing mappings (DIMs),
code constructions, permutation arrays (PAs), Hamming distance

Retrieve PDF document (**200707_17.pdf**)

Received May 16, 2005; revised August 16 & October 24, 2005; accepted November 14, 2005.

Communicated by Chi-Jen Lu.
^{*}This work was supported in part by the National Science Council of Taiwan, R.O.C., under contracts No.
NSC 94-2213-E-305-003 and NSC 95-2213-E-305-002.