Distance-increasing mappings from binary vectors to permutations that increase hamming distances by at least two

IEEE Transactions on Information Theory

Volumn 52, Issue 4, 2006, Pages 1683-1689

  Chang, Jen Chun ^a  

^a NATIONAL TAIPEI UNIVERSITY   (Taiwan)

Author keywords

Code construction; Distance increasing mappings (DIMs); Distance preserving mappings (DPMs); Hamming distance; Permutation arrays (PAs)

Indexed keywords

INTEGER PROGRAMMING; SET THEORY; VECTORS;

CODE CONSTRUCTION; DISTANCE-INCREASING MAPPINGS (DIMS); DISTANCE-PRESERVING MAPPINGS (DPMS); HAMMING DISTANCE; PERMUTATION ARRAYS (PAS);

CODES (SYMBOLS);

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

References (4)

1. H. C. Ferreira and A. J. H. Vinck, "Interference cancellation with permutation trellis codes," in Proc. IEEE Vehicular Technology Conf., Tokyo, Japan, May 2000, pp. 2401-2407.
2. 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.
3. K. Lee, "New distance preserving maps of odd length," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2539-2543, Oct. 2004.
4. J.-C. Chang, "Distance-increasing mappings from binary vectors to permutations," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 359-363, Jan. 2005.