Finding roots of polynomials over finite fields
Sergei Valentinovich Fedorenko, Peter Trifonov · IEEE Transactions on Communications · 2002
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.