Decoding distance-preserving permutation codes for power-line communications

IEEE AFRICON Conference

Volumn , Issue , 2007, Pages

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

^a UNIVERSITY OF JOHANNESBURG   (South Africa)

Author keywords

[No Author keywords available]

Indexed keywords

CANNING; CODES (SYMBOLS); CONFORMAL MAPPING; DECODING; ERROR CORRECTION; MATHEMATICAL TRANSFORMATIONS;

ERROR CORRECTION CODE; MAPPING ALGORITHMS; MINIMUM-DISTANCE DECODING; NEW APPROACHES; PERMUTATION CODES; POWER-LINE CHANNELS; POWER-LINE COMMUNICATIONS;

CODES (STANDARDS);

EID: 48649098626     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/AFRCON.2007.4401563     Document Type: Conference Paper

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. A. J. H. Vinck, J. Häring and T. Wadayama, "Coded M-FSK for power line communications," in Proc. Int. Symp. on Inform. Theory, Sorrento, Italy, June 25-30, 2000, p. 137.
3. 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.
4. 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.
5. T. G. Swart, I. de Beer, H. C. Ferreira and A. J. H. Vinck, "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. 6-8, 2005, pp. 317-321.
6. 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.
7. K. Lee, "New distance-preserving mappings of odd length," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2539-2543, Oct. 2004.
8. K. Lee, "Cyclic constructions of distance-preserving maps," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4392-4396, Dec. 2005.
9. 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.
10. J.-C. Chang, "Distance-increasing mappings from binary vectors to permutations," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 359-363, Jan. 2005.
11. T. G. Swart, I. de Beer and H. C. Ferreira, "On the optimality of permutation mappings," in Proc. Int. Symp. Inf. Theory, Adelaide, Australia, Sept. 4-9, 2005, pp. 1068-1072.
12. 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.
13. T. G. Swart, H. C. Ferreira and K. Ouahada, "Using graphs for the analysis and construction of permutation distance-preserving mappings", IEEE Trans. Inf. Theory, submitted for publication.
14. H. C. Ferreira, H. M. Grove, O. Hooijen and A. J. H. Vinck, "Power line communication," in Wiley Encyclopedia of Electrical and Electronics Engineering, J. G. Webster, Ed. New York: Wiley, 1999, vol. 16, pp. 706-716.