Cyclic constructions of distance-preserving maps

IEEE Transactions on Information Theory

Volumn 51, Issue 12, 2005, Pages 4392-4396

  Lee, Kwankyu ^a  

^a SAN DIEGO STATE UNIVERSITY   (United States)

Author keywords

Distance preserving maps (DPMs); Hamming distance; Permutation arrays

Indexed keywords

ALGORITHMS; MATRIX ALGEBRA; SET THEORY; THEOREM PROVING; VECTORS;

DISTANCE PRESERVING MAPS (DPMS); HAMMING DISTANCE; MAPPING ALGORITHM; PERMUTATION ARRAYS;

INFORMATION THEORY;

EID: 29144473352     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2005.858990     Document Type: Article

References (3)

1. J.-C. Chang, R.-J. Chen, T. Kløve, and S.-C. Tsai, "Distance-preserving mappings from binary vectors to permutations," IEEE Trans. Inf. Theory, vol. 49, no. 4, pp. 1054-1059, Apr. 2003.
2. K. Lee, "New distance-preserving maps of odd length," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2539-2543, Oct. 2004.
3. J.-C. Chang, "Distance-increasing mappings from binary vectors to permutations," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 359-363, Jan. 2005.