HackerPapers

arXiv:1102.4772cs.IT

Polynomial evaluation over finite fields: new algorithms and complexity bounds

Michele Elia, Joachim Rosenthal, Davide Schipani

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

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.

arXiv comments
accepted for publication in Applicable Algebra in Engineering, Communication and Computing. The final publication will be available at springerlink.com. DOI: 10.1007/s00200-011-0160-6
Journal reference
DOI
Subjects
cs.ITInformation Theory math.NTNumber Theory

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Nov 2025 to Nov 2025.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. The state of SIMD in Rust in 2025 1 comment

    • As someone who used std::simd in an attempt for submitting to an academic conference CFP*, I have look deep into how std::simd and I would conclude that there are a couple of reasons it isn't stable yet (this is rather long and maybe need 10 minutes to read): 1. It is highly…

      stevefan1999View on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.