23 citations · 48 across the 16 of their papers we have counts for
5 papers · 1 filter
Involutions, Trace Maps, and Pseudorandom Numbers
Michele Elia, Davide Schipani
Interesting properties of the partitions of a finite field induced by the combination of involutions and trace maps are studied. The special features of involutions o…
Computing the dimension of ideals in group algebras, with an application to coding theory
Michele Elia, Elisa Gorla
The problem of computing the dimension of a left/right ideal in a group algebra F[G] of a finite group G over a field F is considered. The ideal dimension is related to the rank of…
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…