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: IEEE, 154-157.
|Published Version (English)|
PDF - Registered users only
View at publisher
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.
2 downloads since deposited on 14 Jan 2012
0 downloads since 12 months
|Contributors:||NICTA (Australia), IEEE Information Theory Society, CSIRO (Australia)|
|Item Type:||Book Section, refereed, original work|
|Communities & Collections:||07 Faculty of Science > Institute of Mathematics|
|Dewey Decimal Classification:||510 Mathematics|
|Deposited On:||14 Jan 2012 18:34|
|Last Modified:||13 Nov 2014 15:30|
Users (please log in): suggest update or correction for this item
Repository Staff Only: item control page