Michele Elia

Michele Elia received his degree in electrical engineering from Turin Polytechnic, Turin, Italy, in 1970. Since 1990, he has been a Professor of information theory and coding at the Electronics Department, Turin Polytechnic. His early research activity concerned group codes, namely, regular constellations of points that span n-dimensional Euclidean spaces and are preserved by the action of a finite group of matrices. For these group codes, he obtained nontrivial existence conditions (either necessary or sufficient) linking space dimension to code cardinality. He has proposed an algebraic decoding for the Golay code which has also been used to decode other cyclic codes beyond the BCH bound. He also worked, at Turin Polytechnic, to develop a large simulation package for communication systems. At present, he is involved in research concerning algebraic number theory and the complexity of algorithms, which may find applications in cryptography and in the algebraic decoding of error-correcting codes. He is author of numerous technical papers and serves as referee for many scientific and professional journals. He is an Associate Editor of Journal of Discrete Mathematical Science and Cryptography, and of Journal of Statistical Theory and Practice. He served as Chairman of two Italian conferences on cryptography, and was an active member of the technical committee of several international conferences, in the scientific area of communications engineering and in that of Pure Mathematics.

Biography Updated on 27 June 2007

Articles in Scholarly Journals [Incomplete List]

  1. On the Complexity of Parallel Algorithms for Computing Inverses in $GF(2^m)$ with $m$ Prime
    Acta Applicandae Mathematicae, vol. 93, no. 1-3, pp. 149–160, 2006
  2. Quadratic-Residue Codes and Cyclotomic Fields
    Acta Applicandae Mathematicae, vol. 93, no. 1-3, pp. 237–251, 2006
  3. Orthant spanning simplexes with minimal volume
    International Journal of Mathematics and Mathematical Sciences, vol. 2003, no. 63, pp. 3995–4006, 2003
  4. On the inherent space complexity of fast parallel multipliers for GF(2/sup m/)
    IEEE Transactions on Computers, vol. 51, no. 3, pp. 346–351, 2002
  5. Lattice constellations and codes from quadratic number fields
    IEEE Transactions on Information Theory, vol. 47, no. 4, pp. 1514–1527, 2001
  6. A note on Fibonacci matrices of even degree
    International Journal of Mathematics and Mathematical Sciences, vol. 27, no. 8, pp. 457–469, 2001
  7. On the Optimality of Finite Constellations from Algebraic Lattices
    Electronic Notes in Discrete Mathematics, vol. 6, pp. 271–280, 2001
  8. Optimal energy transfer in band-limited communication channels
    IEEE Transactions on Information Theory, vol. 45, no. 6, pp. 2020–2029, 1999
  9. Decoding of binary separable Goppa codes using Berlekamp-Massey algorithm
    Electronics Letters, vol. 35, no. 20, p. 1720, 1999
  10. Low complexity bit-parallel multipliers for GF(2m) with generator polynomial xm + xk + 1
    Electronics Letters, vol. 35, no. 7, p. 551, 1999
  11. On the decoding of Reed-Solomon and BCH codes over integer residue rings
    IEEE Transactions on Information Theory, vol. 43, no. 3, pp. 1013–1021, 1997
  12. Capacity of fading channel with no side information
    Electronics Letters, vol. 33, no. 16, p. 1368, 1997
  13. Group block codes over nonabelian groups are asymptotically bad
    IEEE Transactions on Information Theory, vol. 42, no. 4, pp. 1277–1280, 1996
  14. Are fifth-degree equations over GF(5 m ) solvable by radicals?
    Applicable Algebra in Engineering, Communication and Computing, vol. 7, no. 1, pp. 27–40, 1996
  15. Algebraic decoding of the ternary (11,6,5) Golay code
    Electronics Letters, vol. 28, no. 21, p. 2021, 1992
  16. The generating groups of geometrically uniform spherical signal sets
    Applicable Algebra in Engineering, Communication and Computing, vol. 3, no. 3, pp. 163–181, 1992
  17. The optimal linear receiving filter for digital transmission over nonlinear channels
    IEEE Transactions on Information Theory, vol. 35, no. 3, pp. 620–625, 1989
  18. Multidimensional modulation and coding for band-limited digital channels
    IEEE Transactions on Information Theory, vol. 34, no. 4, pp. 803–809, 1988
  19. Algebraic decoding of the (23,12,7) Golay code (Corresp.)
    IEEE Transactions on Information Theory, vol. 33, no. 1, pp. 150–151, 1987
  20. Digital Simulation of Communication Systems with TOPSIM III
    IEEE Journal on Selected Areas in Communications, vol. 2, no. 1, pp. 29–42, 1984
  21. On the Design of Downlinks for Satellite Commuication Systems Using TFM and Convolutional Codes: A Simulation Approach with TOPSIM III
    IEEE Journal on Selected Areas in Communications, vol. 2, no. 1, pp. 42–50, 1984
  22. Performance Analysis of a DCPSK Up-Link for a Regenerative Satellite Repeater
    IEEE Journal on Selected Areas in Communications, vol. 1, no. 1, pp. 63–73, 1983
  23. Some results on the existence of binary linear codes (Corresp.)
    IEEE Transactions on Information Theory, vol. 29, no. 6, pp. 933–934, 1983
  24. Optimum permutation modulation codes and their asymptotic performance (Corresp.)
    IEEE Transactions on Information Theory, vol. 22, no. 6, pp. 751–753, 1976
  25. Cyclic-group codes for the Gaussian channel (Corresp.)
    IEEE Transactions on Information Theory, vol. 22, no. 5, pp. 624–629, 1976
  26. On the existence of group codes for the Gaussian channel
    IEEE Transactions on Information Theory, vol. 18, no. 3, pp. 399–402, 1972