Fast Inversion of Hankel Systems and E cient BCH 1 Decoding

Abstract

| 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.

Cite this paper

@inproceedings{Fettweis1997FastIO, title={Fast Inversion of Hankel Systems and E cient BCH 1 Decoding}, author={Gerhard Fettweis}, year={1997} }