2000 character limit reached
Polynomial evaluation over finite fields: new algorithms and complexity bounds
Published 16 Feb 2011 in cs.IT, math.IT, and math.NT | (1102.4772v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.