Title :
Cyclic constructions of distance-preserving maps
Author_Institution :
Dept. of Math. & Stat., San Diego State Univ., CA
Abstract :
Distance-preserving maps (DPMs) from binary vectors to permutations are useful for the construction of permutation arrays. A new construction of DPMs is presented. We study the distance increasing property of the new DPMs that this construction yields. Then we show that new DPMs contain a class of nicely structured DPMs of even length with good distance increasing property
Keywords :
Hamming codes; binary codes; binary sequences; cyclic codes; vectors; DPM; Hamming distance; binary vector; cyclic construction; distance-preserving map; permutation array; Hamming distance; Mathematics; Scholarships; Statistics; Distance-preserving maps (DPMs); Hamming distance; permutation arrays;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2005.858990
