Correcting adjacent errors using permutation code trees

R. Heymann; T. G. Swart; H. C. Ferreira

doi:10.1109/AFRCON.2011.6072122

Correcting adjacent errors using permutation code trees

R. Heymann, T. G. Swart, H. C. Ferreira

Electrical and Electronic Engineering Science

University of Johannesburg

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Citation (Scopus)

Abstract

Permutation codes are M-ary codes which can be used, in combination with M-ary FSK, to correct errors in Power Line Communications (PLC). It has been shown in [1] that permutation code trees can be used to correct a single substitution or synchronization error per codeword, without the use of markers. In this paper, we show that, due to the structure of the permutation code tree, adjacent errors can also be corrected if the codebook is adapted.

Original language	English
Title of host publication	IEEE Africon'11
DOIs	https://doi.org/10.1109/AFRCON.2011.6072122
Publication status	Published - 2011
Event	IEEE Africon'11 - Victoria Falls, Livingstone, Zambia Duration: 13 Sept 2011 → 15 Sept 2011

Publication series

Name	IEEE AFRICON Conference

Conference

Conference	IEEE Africon'11
Country/Territory	Zambia
City	Victoria Falls, Livingstone
Period	13/09/11 → 15/09/11

ASJC Scopus subject areas

Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/AFRCON.2011.6072122

Cite this

@inproceedings{d3eb775d83ae4535aaa0d9df565974f1,

title = "Correcting adjacent errors using permutation code trees",

abstract = "Permutation codes are M-ary codes which can be used, in combination with M-ary FSK, to correct errors in Power Line Communications (PLC). It has been shown in [1] that permutation code trees can be used to correct a single substitution or synchronization error per codeword, without the use of markers. In this paper, we show that, due to the structure of the permutation code tree, adjacent errors can also be corrected if the codebook is adapted.",

author = "R. Heymann and Swart, {T. G.} and Ferreira, {H. C.}",

year = "2011",

doi = "10.1109/AFRCON.2011.6072122",

language = "English",

isbn = "9781612849928",

series = "IEEE AFRICON Conference",

booktitle = "IEEE Africon'11",

note = "IEEE Africon'11 ; Conference date: 13-09-2011 Through 15-09-2011",

}

TY - GEN

T1 - Correcting adjacent errors using permutation code trees

AU - Heymann, R.

AU - Swart, T. G.

AU - Ferreira, H. C.

PY - 2011

Y1 - 2011

N2 - Permutation codes are M-ary codes which can be used, in combination with M-ary FSK, to correct errors in Power Line Communications (PLC). It has been shown in [1] that permutation code trees can be used to correct a single substitution or synchronization error per codeword, without the use of markers. In this paper, we show that, due to the structure of the permutation code tree, adjacent errors can also be corrected if the codebook is adapted.

AB - Permutation codes are M-ary codes which can be used, in combination with M-ary FSK, to correct errors in Power Line Communications (PLC). It has been shown in [1] that permutation code trees can be used to correct a single substitution or synchronization error per codeword, without the use of markers. In this paper, we show that, due to the structure of the permutation code tree, adjacent errors can also be corrected if the codebook is adapted.

UR - http://www.scopus.com/inward/record.url?scp=82955214912&partnerID=8YFLogxK

U2 - 10.1109/AFRCON.2011.6072122

DO - 10.1109/AFRCON.2011.6072122

M3 - Conference contribution

AN - SCOPUS:82955214912

SN - 9781612849928

T3 - IEEE AFRICON Conference

BT - IEEE Africon'11

T2 - IEEE Africon'11

Y2 - 13 September 2011 through 15 September 2011

ER -

Correcting adjacent errors using permutation code trees

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this