On the Fast Decoding of Binary Bch Codes
W.T. Penzhorn · 2005
Recently, it was shown how to determine the error locator polynomial of a primitive, binary t-error correcting BCH code in a single step [3]. For this purpose it is necessary to transform the set of t syndrome polynomial equations to an equivalent set of polynomial equations, leading to an analytic expression for the error locator polynomial, /spl sigma/(x). These results facilitate decoding beyond the BCH bound, i.e. correcting more than t errors. This requires the resolving of additional syndromes coefficients, which is achieved in a simple and elegant way by means of the expression derived for the syndrome polynomial /spl sigma/(x).