Polynomial evaluation over finite fields: new algorithms and complexity bounds
classification
💻 cs.IT
math.ITmath.NT
keywords
complexityevaluationfieldsfinitepolynomialalgorithmsapplicationsbounds
read the original abstract
An efficient evaluation method is described for polynomials in finite fields. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial is large enough. Applications to the syndrome computation in the decoding of Reed-Solomon codes are highlighted.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.