Michele Elia
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Michele Elia has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Edoardo Ballico
Department of Mathematics, University of Trento, 38123 Trento, Italy
4 shared publications - Davide Schipani
University of Zürich
3 shared publications E. Biglieri
Istituto di Elettronica e Telecomunicazioni del Politecnico, Torino, Italy
3 shared publicationsJoachim Rosenthal
2 shared publications- Massimiliano Sala
University of Trento
2 shared publications Davide Schipani
1 shared publication
Latest Publications
- 20 May 2019
- Published by Pushpa Publishing House in JP Journal of Algebra, Number Theory and Applications
- Vol. 42 (2) , 255-266
ON A PROBLEM OF PERRON
- 20 May 2019
- Published by Pushpa Publishing House in JP Journal of Algebra, Number Theory and Applications
- Vol. 42 (2) , 255-266
ON A PROBLEM OF PERRON
- 11 June 2015
- Published by National Inquiry Services Center (NISC) in Quaestiones Mathematicae
- Vol. 39 (1) , 1-8
On evaluating multivariate polynomials over finite fields
Some evaluation methods of multivariate polynomials over finite fields are described and their multiplicative complexity is discusse
- 11 June 2015
- Published by National Inquiry Services Center (NISC) in Quaestiones Mathematicae
- Vol. 39 (1) , 1-8
On evaluating multivariate polynomials over finite fields
Some evaluation methods of multivariate polynomials over finite fields are described and their multiplicative complexity is discusse
- Open Access
On Determinantal Varieties of Hankel Matrices
Let be a class of Hankel matrices whose entries, depending on a given matrix , are linear forms in variables with coefficients in a finite field . For every matrix in , it is shown that the varieties specified by the leading minors of orders from 1 to have the same number of points in . Further properties are derived, which show that sets of varieties, tied to a given Hankel matrix, resemble a set of hyperplanes as regards the number of points of their intersections.Open AccessOn Determinantal Varieties of Hankel Matrices
Let be a class of Hankel matrices whose entries, depending on a given matrix , are linear forms in variables with coefficients in a finite field . For every matrix in , it is shown that the varieties specified by the leading minors of orders from 1 to have the same number of points in . Further properties are derived, which show that sets of varieties, tied to a given Hankel matrix, resemble a set of hyperplanes as regards the number of points of their intersections. - 31 July 2012
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 50, 255-262
On the evaluation of multivariate polynomials over finite fields
- 31 July 2012
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 50, 255-262
On the evaluation of multivariate polynomials over finite fields
- 16 December 2011
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 23 (3-4) , 129-141
Polynomial evaluation over finite fields: new algorithms and complexity bounds
- 16 December 2011
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 23 (3-4) , 129-141
Polynomial evaluation over finite fields: new algorithms and complexity bounds
- Open Access
Complexity of multivariate polynomial evaluation
We describe a method to evaluate multivariate polynomials over a finite field and discuss its multiplicative complexity.
Open AccessComplexity of multivariate polynomial evaluation
We describe a method to evaluate multivariate polynomials over a finite field and discuss its multiplicative complexity.
- Open Access
On the Decoding Complexity of Cyclic Codes Up to the BCH Bound
The standard algebraic decoding algorithm of cyclic codes $[n,k,d]$ up to the BCH bound $t$ is very efficient and practical for relatively small $n$ while it becomes unpractical for large $n$ as its computational complexity is $O(nt)$. Aim of this paper is to show how to make this algebraic decoding computationally more efficient: in the case of binary codes, for example, the complexity of the syndrome computation drops from $O(nt)$ to $O(t\sqrt n)$, and that of the error location from $O(nt)$ to at most $\max \{O(t\sqrt n), O(t^2\log(t)\log(n))\}$.Open AccessOn the Decoding Complexity of Cyclic Codes Up to the BCH Bound
The standard algebraic decoding algorithm of cyclic codes $[n,k,d]$ up to the BCH bound $t$ is very efficient and practical for relatively small $n$ while it becomes unpractical for large $n$ as its computational complexity is $O(nt)$. Aim of this paper is to show how to make this algebraic decoding computationally more efficient: in the case of binary codes, for example, the complexity of the syndrome computation drops from $O(nt)$ to $O(t\sqrt n)$, and that of the error location from $O(nt)$ to at most $\max \{O(t\sqrt n), O(t^2\log(t)\log(n))\}$. - Open Access
Efficient evaluation of polynomials over finite fields
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.
Open AccessEfficient evaluation of polynomials over finite fields
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.
- 1 January 2011
- Published by Institute of Mathematics, Polish Academy of Sciences in Bulletin of the Polish Academy of Sciences. Mathematics
- Vol. 59 (1) , 11-18
Gauss Sums of the Cubic Character over GF(2m): an Elementary Derivation
- 1 January 2011
- Published by Institute of Mathematics, Polish Academy of Sciences in Bulletin of the Polish Academy of Sciences. Mathematics
- Vol. 59 (1) , 11-18
Gauss Sums of the Cubic Character over GF(2m): an Elementary Derivation
- 4 August 2006
- Published by Springer Nature in Acta Applicandae Mathematicae
- Vol. 93 (1-3) , 149-160
On the Complexity of Parallel Algorithms for Computing Inverses in $GF(2^m)$ with $m$ Prime- 4 August 2006
- Published by Springer Nature in Acta Applicandae Mathematicae
- Vol. 93 (1-3) , 149-160
On the Complexity of Parallel Algorithms for Computing Inverses in $GF(2^m)$ with $m$ Prime