On the distance optimality of permutation mappings

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005-January, Issue , 2005, Pages

  Swart, Theo G ^a   de Beer, Ian ^a   Ferreira, Hendrik C ^a  

^a UNIVERSITY OF JOHANNESBURG   (South Africa)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEQUENCES; HAMMING DISTANCE; INFORMATION THEORY;

OPTIMALITY;

MAPPING;

EID: 85114353285     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523503     Document Type: Conference Paper

References (8)

1. H. C. Ferreira, D. A. Wright and A. L. Nel, “Hamming distance preserving mappings and trellis codes with constrained binary symbols,” IEEE Trans. Inform. Theory, vol. 35, no. 5, pp. 1098-1103, Sep. 1989.
2. C. A. French, “Distance preserving run-length limited codes,” IEEE Trans. Magn., vol. 25, no. 5, pp. 4093-4095, Sep. 1989.
3. H. C. Ferreira and A. J. H. Vinck, “Interference cancellation with permutation trellis codes,” in Proc. IEEE Veh. Technol. Conference Fall 2000, (Boston, MA, U.S.A., Sep. 2000), pp. 2401-2407.
4. J.-C. Chang, R.-J. Chen, T. Kløve and S.-C. Tsai, “Distance preserving mappings from binary vectors to permutations,” IEEE Trans. Inform. Theory, vol. 49, no. 4, pp. 1054-1059, Apr. 2003.
5. K. Lee, “New distance-preserving mappings of odd length,” IEEE Trans. Inform. Theory, vol. 50, no. 10, pp. 2539-2543, Oct. 2004.
6. J.-C. Chang, “Distance-increasing mappings from binary vectors to permutations,” IEEE Trans. Inform. Theory, vol. 51, no. 1, pp. 359-363, Jan. 2005.
7. K. W. Shum, “Permutation coding and MFSK modulation for frequency selective channel,” in IEEE Proc. PIMRC, (Lisbon, Portugal, Sep. 2002), pp. 2063-2066.
8. A. Dholakia, Introduction to convolutional codes with applications, Kluwer Academic Publishers, 1994.