Finding roots of polynomials over finite fields

We propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speedup of the decoding process of Bose-Chaudhuri-Hocquenghem, Reed-Solomon, and some other error-correcting codes.

[1]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

[2]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[3]  Robert T. Chien,et al.  Hybrid methods for finding roots of a polynomial - With application to BCH decoding (Corresp.) , 1969, IEEE Trans. Inf. Theory.

[4]  Trieu-Kien Truong,et al.  Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders , 2001, IEEE Trans. Commun..