Michele Elia

Publication Activity (10 Years)

Years Active: 1972-2021
Publications (10 Years): 3

Top Topics

Complexity Bounds

Top Venues

Appl. Algebra Eng. Commun. Comput.

Appl. Math. Comput.

Publications

Emanuele Bellini, Nadir Murru, Antonio J. Di Scala, Michele Elia
Group law on affine conics and applications to cryptography. Appl. Math. Comput. 409 (2021)
Ezio Biglieri, Emanuele Viterbo, Michele Elia
Error Control of Line Codes Generated by Finite Coxeter Groups. ITA (2018)
Michele Elia, Davide Schipani
Involutions, Trace Maps, and Pseudorandom Numbers. CoRR (2016)
Michele Elia, Matteo Piva, Davide Schipani
The Rabin cryptosystem revisited. Appl. Algebra Eng. Commun. Comput. 26 (3) (2015)
Michele Elia, Elisa Gorla
Computing the dimension of ideals in group algebras, with an application to coding theory. CoRR (2014)
Edoardo Ballico, Michele Elia, Massimiliano Sala
On the evaluation of multivariate polynomials over finite fields. J. Symb. Comput. 50 (2013)
Michele Elia, Joachim Rosenthal, Davide Schipani
Polynomial evaluation over finite fields: new algorithms and complexity bounds. Appl. Algebra Eng. Commun. Comput. 23 (3-4) (2012)
Michele Elia, Davide Schipani
On the Rabin signature CoRR (2011)
Edoardo Ballico, Michele Elia, Massimiliano Sala
Complexity of multivariate polynomial evaluation CoRR (2011)
Davide Schipani, Michele Elia, Joachim Rosenthal
Efficient evaluation of polynomials over finite fields CoRR (2011)
Davide Schipani, Michele Elia, Joachim Rosenthal
On the decoding complexity of cyclic codes up to the BCH bound. ISIT (2011)
Michele Elia, Joachim Rosenthal, Davide Schipani
Polynomial evaluation over finite fields: new algorithms and complexity bounds CoRR (2011)
Michele Elia, Matteo Piva, Davide Schipani
The Rabin cryptosystem revisited CoRR (2011)
Davide Schipani, Michele Elia, Joachim Rosenthal
On the Decoding Complexity of Cyclic Codes Up to the BCH Bound CoRR (2011)
Michele Elia, Manuel Leone
A Basis-Independent Algorithm to Design Fast Parallel Multipliers over GF(2m). ITCC (2) (2004)
Michele Elia, Manuel Leone
On the Inherent Space Complexity of Fast Parallel Multipliers for GF(2/supm/). IEEE Trans. Computers 51 (3) (2002)
Gianni Guarco, Monica Visintin, Michele Elia
hing reed - solomon codes with 4 - DPSK block detectors. Eur. Trans. Telecommun. 12 (2) (2001)
J. Carmelo Interlando, Michele Elia, Trajano Pires da Nóbrega Neto
On the Optimality of Finite Constellations from Algebraic Lattices. Electron. Notes Discret. Math. 6 (2001)
Trajano Pires da Nóbrega Neto, J. Carmelo Interlando, Osvaldo Milaré Favareto, Michele Elia, Reginaldo Palazzo Júnior
Lattice constellations and codes from quadratic number fields. IEEE Trans. Inf. Theory 47 (4) (2001)
Michele Elia, Giorgio Taricco, Emanuele Viterbo
Optimal energy transfer in band-limited communication channels. IEEE Trans. Inf. Theory 45 (6) (1999)
J. Carmelo Interlando, Reginaldo Palazzo Júnior, Michele Elia
On the decoding of Reed-Solomon and BCH codes over integer residue rings. IEEE Trans. Inf. Theory 43 (3) (1997)
J. Carmelo Interlando, Reginaldo Palazzo Júnior, Michele Elia
Group block codes over nonabelian groups are asymptotically bad. IEEE Trans. Inf. Theory 42 (4) (1996)
Michele Elia
) solvable by radicals? Appl. Algebra Eng. Commun. Comput. 7 (1) (1995)
Giacinto Losquadro, Philippe Michel, Michele Elia, Monica Visintin
Letter: Impact of RFI Detection in DRS Links on the Performance of Coding Schemes. Eur. Trans. Telecommun. 4 (5) (1993)
Michele Elia, Ezio Biglieri
The Generating Groups of Geometrically Uniform Spherical Signal Sets. Appl. Algebra Eng. Commun. Comput. 3 (1992)
Michele Elia, Giorgio Taricco
A note on automorphism groups of codes and symbol error probability computation. EUROCODE (1990)
Ezio Biglieri, Michele Elia, Letizia Lopresti
The optimal linear receiving filter for digital transmission over nonlinear channels. IEEE Trans. Inf. Theory 35 (3) (1989)
Ezio Biglieri, Michele Elia
Multidimensional modulation and coding for band-limited digital channels. IEEE Trans. Inf. Theory 34 (4) (1988)
Michele Elia
Algebraic decoding of the (23, 12, 7) Golay code. IEEE Trans. Inf. Theory 33 (1) (1987)
Michele Elia
On the non-existence of Barker sequences. Comb. 6 (3) (1986)
Michele Elia, Giancarlo Prati
On the complete decoding of binary linear codes. IEEE Trans. Inf. Theory 31 (4) (1985)
Marco Ajmone Marsan, Sergio Benedetto, Ezio Biglieri, Valentino Castellani, Michele Elia, Letizia Lo Presti, Mario Pent
Digital Simulation of Communication Systems with TOPSIM III. IEEE J. Sel. Areas Commun. 2 (1) (1984)
Giuliano Canovai, Michele Elia, Letizia Lo Presti, Mario Pent
On the Design of Downlinks for Satellite Commuication Systems Using TFM and Convolutional Codes: A Simulation Approach with TOPSIM III. IEEE J. Sel. Areas Commun. 2 (1) (1984)
Valentino Castellani, Michele Elia, Letizia Lo Presti, Mario Pent
Performance Analysis of a DCPSK Up-Link for a Regenerative Satellite Repeater. IEEE J. Sel. Areas Commun. 1 (1) (1983)
Michele Elia
Some results on the existence of binary linear codes. IEEE Trans. Inf. Theory 29 (6) (1983)
Ezio Biglieri, Michele Elia
Optimum permutation modulation codes and their asymptotic performance (Corresp.). IEEE Trans. Inf. Theory 22 (6) (1976)
Ezio Biglieri, Michele Elia
Cyclic-group codes for the Gaussian channel (Corresp.). IEEE Trans. Inf. Theory 22 (5) (1976)
Renato de Mori, Michele Elia, Angelo Serra
Minimization methods for macrocellular arithmetic networks. IEEE Symposium on Computer Arithmetic (1975)
Ezio Biglieri, Michele Elia
On the existence of group codes for the Gaussian channel. IEEE Trans. Inf. Theory 18 (3) (1972)