Algebraic decoding beyond e/sub BCH/ of some binary cyclic codes, when e>e/sub BCH/
P.A.H. Bours, Jeannette Janssen, M. Van Asperdt, Henk C. A. van Tilborg · IEEE Transactions on Information Theory · 1990
For a number of binary cyclic codes with e>e/sub BCH/, algebraic algorithms are given to find the error locator polynomial. Thus, for these codes more errors can be corrected algebraically than by the Berlekamp-Massey algorithm. In some cases, all error patterns of weight up to e can be decoded; in other cases, only error patterns of weight up to e' with e/sub BCH/>