Polynomial evaluation over finite fields: new algorithms and complexity bounds
Information Theory
2011-12-08 v2 math.IT
Number Theory
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.
Cite
@article{arxiv.1102.4772,
title = {Polynomial evaluation over finite fields: new algorithms and complexity bounds},
author = {Michele Elia and Joachim Rosenthal and Davide Schipani},
journal= {arXiv preprint arXiv:1102.4772},
year = {2011}
}
Comments
accepted for publication in Applicable Algebra in Engineering, Communication and Computing. The final publication will be available at springerlink.com. DOI: 10.1007/s00200-011-0160-6