23 citations · 48 across the 16 of their papers we have counts for
3 papers · 2 filters
Efficient evaluation of polynomials over finite fields
Davide Schipani, Michele Elia, Joachim Rosenthal
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 low…
Polynomial evaluation over finite fields: new algorithms and complexity bounds
Michele Elia, Joachim Rosenthal, Davide Schipani
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…
On the Decoding Complexity of Cyclic Codes Up to the BCH Bound
Davide Schipani, Michele Elia, Joachim Rosenthal
The standard algebraic decoding algorithm of cyclic codes up to the BCH bound is very efficient and practical for relatively small while it becomes unpractical fo…