Distance-increasing mappings from binary vectors to permutations

IEEE Transactions on Information Theory

Volumn 51, Issue 1, 2005, Pages 359-363

  Chang, Jen Chun ^a  

^a NATIONAL TAIPEI UNIVERSITY   (Taiwan)

Author keywords

Code constructions; Distance preserving mappings (DPMs); Hamming distance; Mapping; Permutation arrays (PAs)

Indexed keywords

ALGORITHMS; RECURSIVE FUNCTIONS; THEOREM PROVING; VECTORS;

CODE CONSTRUCTIONS; DISTANCE PRESERVING MAPPINGS (DPMS); HAMMING DISTANCE; PERMUTATION ARRAYS (PAS);

CODES (SYMBOLS);

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

References (2)

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, to be published.