Quick Search:
Browse by:

Zurich Open Repository and Archive

Permanent URL to this publication: http://dx.doi.org/10.5167/uzh-55153

Schipani, D; Elia, M; Rosenthal, J (2011). Efficient evaluations of polynomials over finite fields. In: IEEE. Proceedings of the 2011 Australian Communications Theory Workshop : the University of Melbourne, Melbourne, Australia, 31st January - 2nd February 2011. Piscataway, NJ, US, 154-157. ISBN 978-1-4244-9714-0 (P).

 Published Version (English) PDF - Registered users only 94kBView at publisher

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.