Efficient evaluation of polynomials over finite fields

Details Efficient evaluation of polynomials over finite fields Efficient evaluation of polynomials over finite fields

2011-02-16

arxiv.org/abs/1102.4771v1

Computer Science

Information Theory

presented at AusCTW 2011

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Efficient evaluation of polynomials over finite fields does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient evaluation of polynomials over finite fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient evaluation of polynomials over finite fields will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-381265