Finding roots of polynomials over finite fields

In this paper we propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speed up of the decoding process of BCH, Reed-Solomon and some other error-correcting codes. Keywords Chien search, error locator polynomial, p-polynomial, linearized polynomial, affine polynomial, BCH code, ReedSolomon code

• Type: Journal
• Year: 2006
• Where: CORR
• Authors: Sergei V. Fedorenko, Peter Vladimirovich Trifonov
• Keywords: CORR 2006, Education, Finite Fields, Improved Algorithm, Polynomial