Sciweavers

Share
CORR
2006
Springer

Finding roots of polynomials over finite fields

8 years 3 months ago
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
Sergei V. Fedorenko, Peter Vladimirovich Trifonov
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where CORR
Authors Sergei V. Fedorenko, Peter Vladimirovich Trifonov
Comments (0)
books