Polynomial evaluation over finite fields: new algorithms and complexity bounds

Details Polynomial evaluation over finite fields: new algorithms and complexity bounds Polynomial evaluation over finite fields: new algorithms and complexity bounds

2011-02-16

arxiv.org/abs/1102.4772v2

Computer Science

Information Theory

accepted for publication in Applicable Algebra in Engineering, Communication and Computing. The final publication will be avai

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Polynomial evaluation over finite fields: new algorithms and complexity bounds 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 Polynomial evaluation over finite fields: new algorithms and complexity bounds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polynomial evaluation over finite fields: new algorithms and complexity bounds will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-381271