Using graphs for the analysis and construction of permutation distance-preserving mappings

IEEE Transactions on Information Theory

Volumn 54, Issue 2, 2008, Pages 910-916

  Swart, Theo G ^a   Ferreira, Hendrik C ^a   Ouahada, Khmaies ^a  

^a UNIVERSITY OF JOHANNESBURG   (South Africa)

Author keywords

Code constructions; Distance preserving mappings (DPMs); Graphs; Permutation coding

Indexed keywords

ALGORITHMS; ENCODING (SYMBOLS); GRAPH THEORY;

CODE CONSTRUCTIONS; DISTANCE-PRESERVING MAPPINGS; PERMUTATION CODING;

CONFORMAL MAPPING;

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

References (11)

1. A. J. H. Vinck, "Coded modulation for powerline communications," Proc. Int. J. Elec. Commun., vol. 54, no. 1, pp. 45-49, 2000.
2. 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.
3. H. C. Ferreira, A. J. H. Vinck, T. G. Swart, and I. de Beer, "Permutation trellis codes," IEEE Trans. Commun., vol. 53, pp. 1782-1789, Nov. 2005.
4. 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.
5. K. Lee, "New distance-preserving mappings of odd length," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2539-2543, Oct. 2004.
6. J.-C. Chang, "Distance-increasing mappings from binary vectors to permutations," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 359-363, Jan. 2005.
7. T. G. Swart, I. deBeer, and H. C. Ferreira, "Ontheoptimality of permutation mappings," in Proc. Int. Symp. Inf. Theory, Adelaide, Australia, Sep. 4-9, 2005, pp. 1068-1072.
8. T. G. Swart and H. C. Ferreira, "A generalized upper bound and a multilevel construction for distance-preserving mappings," IEEE Trans. Inf. Theory, vol. 52, no. 8, pp. 3685-3695, Aug. 2006.
9. K. Lee, "Cyclic constructions of distance-preserving maps," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4392-4396, Dec. 2005.
10. K. Lee, "Distance-increasing mappings of all lengths by simple mapping algorithms," IEEE Trans. Inf. Theory, vol. 52, no. 7, pp. 3344-3348, Jul. 2006.
11. T. G. Swart and H. C. Ferreira, "Decoding distance-preserving permutation codes for power-line communications," in Proc. IEEE AFRICON 2007, Windhoek, Nantibia, Sep. 2007.