Home > Research > Publications & Outputs > Algebraic properties of BCH codes useful for de...
View graph of relations

Algebraic properties of BCH codes useful for decoding

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Algebraic properties of BCH codes useful for decoding. / Cardoso Da Rocha, Valdemar; Honary, Bahram; Bate, Steve D.
In: International Journal of Satellite Communications, Vol. 7, No. 3, 1989, p. 225-229.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Cardoso Da Rocha, V, Honary, B & Bate, SD 1989, 'Algebraic properties of BCH codes useful for decoding', International Journal of Satellite Communications, vol. 7, no. 3, pp. 225-229. https://doi.org/10.1002/sat.4600070313

APA

Cardoso Da Rocha, V., Honary, B., & Bate, S. D. (1989). Algebraic properties of BCH codes useful for decoding. International Journal of Satellite Communications, 7(3), 225-229. https://doi.org/10.1002/sat.4600070313

Vancouver

Cardoso Da Rocha V, Honary B, Bate SD. Algebraic properties of BCH codes useful for decoding. International Journal of Satellite Communications. 1989;7(3):225-229. doi: 10.1002/sat.4600070313

Author

Cardoso Da Rocha, Valdemar ; Honary, Bahram ; Bate, Steve D. / Algebraic properties of BCH codes useful for decoding. In: International Journal of Satellite Communications. 1989 ; Vol. 7, No. 3. pp. 225-229.

Bibtex

@article{5582433eaea84de38bae20fd75c8391f,
title = "Algebraic properties of BCH codes useful for decoding",
abstract = "In this paper theorems are presented which allow the simplified decoding of (n, k, δ) BCH codes in certain cases of practical interest. Such results are in a way implicit in the theory of BCH codes, but so far have not appeared explicitly in the literature. It is shown that any t0 errors, 1 ⩽ t0 ⩽ δ-1, can be detected by using any set of only t0 consecutive coefficients of the syndrome polynomial. The correction of any t0 errors, 1 ⩽ t0 ⩽ [(δ-1)/2], can be performed by using any set of 2t0 consecutive coefficients of the syndrome polynomial, where [x] means the integer part of x. Similar results are derived for punctured BCH codes. In this case sets of t0 or 2t0 consecutive coefficients, respectively, for detecting or correcting t0 errors, are selected from the δ-1-p higher-order coefficients of the modified syndrome polynomial, where p is the number of digits punctured from a code word. These results hold true even when the punctured digits are not consecutive.",
keywords = "Error detection and correction, BCH codes, Decoding, Punctured codes, Cyclic codes",
author = "{Cardoso Da Rocha}, Valdemar and Bahram Honary and Bate, {Steve D.}",
year = "1989",
doi = "10.1002/sat.4600070313",
language = "English",
volume = "7",
pages = "225--229",
journal = "International Journal of Satellite Communications",
issn = "1099-1247",
publisher = "John Wiley and Sons Inc.",
number = "3",

}

RIS

TY - JOUR

T1 - Algebraic properties of BCH codes useful for decoding

AU - Cardoso Da Rocha, Valdemar

AU - Honary, Bahram

AU - Bate, Steve D.

PY - 1989

Y1 - 1989

N2 - In this paper theorems are presented which allow the simplified decoding of (n, k, δ) BCH codes in certain cases of practical interest. Such results are in a way implicit in the theory of BCH codes, but so far have not appeared explicitly in the literature. It is shown that any t0 errors, 1 ⩽ t0 ⩽ δ-1, can be detected by using any set of only t0 consecutive coefficients of the syndrome polynomial. The correction of any t0 errors, 1 ⩽ t0 ⩽ [(δ-1)/2], can be performed by using any set of 2t0 consecutive coefficients of the syndrome polynomial, where [x] means the integer part of x. Similar results are derived for punctured BCH codes. In this case sets of t0 or 2t0 consecutive coefficients, respectively, for detecting or correcting t0 errors, are selected from the δ-1-p higher-order coefficients of the modified syndrome polynomial, where p is the number of digits punctured from a code word. These results hold true even when the punctured digits are not consecutive.

AB - In this paper theorems are presented which allow the simplified decoding of (n, k, δ) BCH codes in certain cases of practical interest. Such results are in a way implicit in the theory of BCH codes, but so far have not appeared explicitly in the literature. It is shown that any t0 errors, 1 ⩽ t0 ⩽ δ-1, can be detected by using any set of only t0 consecutive coefficients of the syndrome polynomial. The correction of any t0 errors, 1 ⩽ t0 ⩽ [(δ-1)/2], can be performed by using any set of 2t0 consecutive coefficients of the syndrome polynomial, where [x] means the integer part of x. Similar results are derived for punctured BCH codes. In this case sets of t0 or 2t0 consecutive coefficients, respectively, for detecting or correcting t0 errors, are selected from the δ-1-p higher-order coefficients of the modified syndrome polynomial, where p is the number of digits punctured from a code word. These results hold true even when the punctured digits are not consecutive.

KW - Error detection and correction

KW - BCH codes

KW - Decoding

KW - Punctured codes

KW - Cyclic codes

U2 - 10.1002/sat.4600070313

DO - 10.1002/sat.4600070313

M3 - Journal article

VL - 7

SP - 225

EP - 229

JO - International Journal of Satellite Communications

JF - International Journal of Satellite Communications

SN - 1099-1247

IS - 3

ER -