Polynomial evaluation over finite fields: new algorithms and complexity bounds
arXiv:1102.4772
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.
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