Errors-and-erasures decoding of BCH codes
Patrick M. Fitzpatrick · IEE Proceedings - Communications · 1999
A Gröbner basis algorithm for errors-and-erasures decoding of BCH codes that avoids computation of the modified syndrome polynomial is given. The decoding problem is viewed as an instance of a more general interpolation problem. The algorithm has the same computational complexity as the Berlekamp–Massey algorithm but is more efficient in hardware.