Fast inversion of Hankel systems and efficient BCH decoding
M. Schmidt, Gerhard Paul Fettweis · 2002
BCH decoding usually involves the evaluation of the error-locator polynomial. This is often achieved with the Berlekamp-Massey algorithm. The evaluation of the error-locator polynomial may also be computed using fast inversion techniques for Hankel matrices. It can be shown that O(lt) steps are necessary, with l being the number of errors which occurred and t being the error-correction capability of the BCH code.