Distance-increasing maps of all lengths by simple mapping algorithms

IEEE Transactions on Information Theory

Volumn 52, Issue 7, 2006, Pages 3344-3348

  Lee, Kwankyu ^a  

^a SAN DIEGO STATE UNIVERSITY   (United States)

Author keywords

Distance increasing maps (DIMs); Distance preserving maps; Hamming distance; Permutation arrays

Indexed keywords

ALGORITHMS; MAPPING; MAPS;

BINARY VECTORS; DISTANCE-INCREASING MAPS (DIMS); DISTANCE-PRESERVING MAPS; HAMMING DISTANCE; PERMUTATION ARRAYS;

INFORMATION THEORY;

EID: 33746924861     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.876200     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. J.-C. Chang, "Distance-increasing mappings from binary vectors to permutations," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 359-363, Jan. 2005.
3. K. Lee, "Cyclic constructions of distance-preserving maps," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4392-4396, Dec. 2005.