Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

CORR
2006
Springer

favoriteEmaildiscussreport

163views Education» more CORR 2006»

Finding roots of polynomials over finite fields

13 years 4 months ago

Finding roots of polynomials over finite fields

Download k36.org

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

Real-time Traffic

CORR 2006 | Education | Finite Fields | Improved Algorithm | Polynomial |

claim paper

Related Content

» Detecting Rational Points on Hypersurfaces over Finite Fields

» LowComplexity BitParallel Square Root Computation over GF2m for All Trinomials

» Trading GRH for algebra algorithms for factoring polynomials and related structures

» Finding Roots of Unity Among Quotients of the Roots of an Integral Polynomial

» On Exponential Sums Nowton identities and Dickson Polynomials over Finite Fields

» A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers

» Subquadratictime factoring of polynomials over finite fields

» Polynomial Multiplication over Finite Fields Using Field Extensions and Interpolation

» A Deterministic Multivariate Interpolation Algorithm for Small Finite Fields

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	CORR
Authors	Sergei V. Fedorenko, Peter Vladimirovich Trifonov

Comments (0)