A generalized upper bound and a multilevel construction for distance-preserving mappings

IEEE Transactions on Information Theory

Volumn 52, Issue 8, 2006, Pages 3685-3695

  Swart, Theo G ^a   Ferreira, Hendrick C ^a  

^a UNIVERSITY OF JOHANNESBURG   (South Africa)

Author keywords

Code constructions; Distance bounds; Distance preserving mappings (DPMs); Hamming distance; Permutation coding

Indexed keywords

MAP SYMBOLS; MAPPING; MATHEMATICAL MODELS; SET THEORY;

CODE CONSTRUCTION; DISTANCE BOUNDS; DISTANCE-PRESERVING MAPPINGS (DPMS); HAMMING DISTANCE; PERMUTATION CODING;

CODES (SYMBOLS);

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

References (14)

1. A. J. H. Vinck, "Coded modulation for powerline communications," Proc. Int. J. Elec. Commun., vol. 54, no. 1, pp. 45-49, 2000.
2. I. F. Blake, "Permutation codes for discrete channels," IEEE Trans. Inf. Theory, vol. 20, no. 1, pp. 138-140, Jan. 1974.
3. M. Deza and S. A. Vanstone, "Bounds on permutation arrays," J. Stat. Planning Inference, vol. 2, no. 2, pp. 197-209, 1978.
4. I. F. Blake, G. Cohen, and M. Deza, "Coding with permutations," Inf. Contr., vol. 43, no. 1, pp. 1-19, Oct. 1979.
5. H. C. Ferreira and A. J. H. Vinck, "Interference cancellation with permutation trellis codes," in Proc. IEEE Veh. Technol. Conf. Fall 2000, Boston, MA, Sep. 2000, pp. 2401-2407.
6. H. C. Ferreira, D. A. Wright, and A. L. Nel, "Hamming distance preserving mappings and trellis codes with constrained binary symbols," IEEE Trans. Inf. Theory, vol. 35, no. 5, pp. 1098-1103, Sept. 1989.
7. C. A. French, "Distance preserving run-length limited codes," IEEE Trans. Magn., vol. 25, no. 5, pp. 4093-4095, Sep. 1989.
8. T. G. Swart, I. de Beer, and H. C. Ferreira, "Simulation results for permutation trellis codes using M-ary FSK," in Proc. Int. Symp. on Power Line Commun. and its Applications, Vancouver, BC, Canada, Apr. 2005, pp. 317-321.
9. H. C. Ferreira, A. J. H. Vinck, T. G. Swart, and I. de Beer, "Permutation trellis codes," IEEE Trans. Commun., vol. 53, no. 11, pp. 1782-1789, Nov. 2005.
10. 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.
11. K. Lee, "New distance-preserving mappings of odd length," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2539-2543, Oct. 2004.
12. J.-C. Chang, "Distance-increasing mappings from binary vectors to permutations," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 359-363, Jan. 2005.
13. T. G. Swart, I. deBeer, and H. C. Ferreira, "On the optimality of permutation mappings," in Proc. Int. Symp. Inf. Theory, Adelaide, Australia, Sep. 4-9, 2005, pp. 1068-1072.
14. T. Wadayama and A. J. H. Vinck, "A multilevel construction of permutation codes," IEICE Trans. Fund., vol. E84-A, no. 10, pp. 2518-2522, Oct. 2001.