Extension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error correction capacities
- 1 September 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 34 (5) , 1332-1340
- https://doi.org/10.1109/18.21263
Abstract
The BCH algorithm is extended to correct more errors than indicated by the BCH bound. In the first step of the decoding procedure, a number of errors corresponding to a particular case of the Hartmann-Tzeng bound are corrected. In the second step full error correction is the goal. A measure for the worst-case number of field elements of an extension field GF(2m) that must be tested for this purpose is given for binary cyclic linear unequal error protection codes as well as for conventional binary cyclic codesKeywords
This publication has 2 references indexed in Scilit:
- On the minimum distance of cyclic codesIEEE Transactions on Information Theory, 1986
- Two topics on linear unequal error protection codes: Bounds on their length and cyclic code classesIEEE Transactions on Information Theory, 1983