Efficient evaluation of polynomials over finite fields
Information Theory
2011-02-24 v1 math.IT
Number Theory
Abstract
A method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial is large with respect to the base field. Applications to the syndrome computation in the decoding of cyclic codes, Reed-Solomon codes in particular, are highlighted.
Cite
@article{arxiv.1102.4771,
title = {Efficient evaluation of polynomials over finite fields},
author = {Davide Schipani and Michele Elia and Joachim Rosenthal},
journal= {arXiv preprint arXiv:1102.4771},
year = {2011}
}
Comments
presented at AusCTW 2011