default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichele Elia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j26]Emanuele Bellini
, Nadir Murru, Antonio J. Di Scala, Michele Elia:
Group law on affine conics and applications to cryptography. Appl. Math. Comput. 409: 125537 (2021)
2010 – 2019
- 2018
- [c5]Ezio Biglieri, Emanuele Viterbo, Michele Elia:
Error Control of Line Codes Generated by Finite Coxeter Groups. ITA 2018: 1-6 - 2016
- [i8]Michele Elia, Davide Schipani:
Involutions, Trace Maps, and Pseudorandom Numbers. CoRR abs/1609.01212 (2016) - 2015
- [j25]Michele Elia, Matteo Piva, Davide Schipani:
The Rabin cryptosystem revisited. Appl. Algebra Eng. Commun. Comput. 26(3): 251-275 (2015) - 2014
- [i7]Michele Elia, Elisa Gorla:
Computing the dimension of ideals in group algebras, with an application to coding theory. CoRR abs/1403.7920 (2014) - 2013
- [j24]Edoardo Ballico, Michele Elia, Massimiliano Sala:
On the evaluation of multivariate polynomials over finite fields. J. Symb. Comput. 50: 255-262 (2013) - 2012
- [j23]Michele Elia, Joachim Rosenthal, Davide Schipani:
Polynomial evaluation over finite fields: new algorithms and complexity bounds. Appl. Algebra Eng. Commun. Comput. 23(3-4): 129-141 (2012) - 2011
- [c4]Davide Schipani, Michele Elia, Joachim Rosenthal:
On the decoding complexity of cyclic codes up to the BCH bound. ISIT 2011: 835-839 - [i6]Davide Schipani, Michele Elia, Joachim Rosenthal:
On the Decoding Complexity of Cyclic Codes Up to the BCH Bound. CoRR abs/1102.2939 (2011) - [i5]Davide Schipani, Michele Elia, Joachim Rosenthal:
Efficient evaluation of polynomials over finite fields. CoRR abs/1102.4771 (2011) - [i4]Michele Elia, Joachim Rosenthal, Davide Schipani:
Polynomial evaluation over finite fields: new algorithms and complexity bounds. CoRR abs/1102.4772 (2011) - [i3]Edoardo Ballico, Michele Elia, Massimiliano Sala:
Complexity of multivariate polynomial evaluation. CoRR abs/1106.2720 (2011) - [i2]Michele Elia, Matteo Piva, Davide Schipani:
The Rabin cryptosystem revisited. CoRR abs/1108.5935 (2011) - [i1]Michele Elia, Davide Schipani:
On the Rabin signature. CoRR abs/1111.3602 (2011)
2000 – 2009
- 2004
- [c3]Michele Elia, Manuel Leone:
A Basis-Independent Algorithm to Design Fast Parallel Multipliers over GF(2m). ITCC (2) 2004: 553-559 - 2002
- [j22]Michele Elia, Manuel Leone:
On the Inherent Space Complexity of Fast Parallel Multipliers for GF(2/supm/). IEEE Trans. Computers 51(3): 346-351 (2002) - 2001
- [j21]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: 271-280 (2001) - [j20]Gianni Guarco, Monica Visintin, Michele Elia:
hing reed - solomon codes with 4 - DPSK block detectors. Eur. Trans. Telecommun. 12(2): 101-104 (2001) - [j19]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): 1514-1527 (2001)
1990 – 1999
- 1999
- [j18]Michele Elia, Giorgio Taricco, Emanuele Viterbo:
Optimal energy transfer in band-limited communication channels. IEEE Trans. Inf. Theory 45(6): 2020-2029 (1999) - 1997
- [j17]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): 1013-1021 (1997) - 1996
- [j16]J. Carmelo Interlando, Reginaldo Palazzo Júnior, Michele Elia:
Group block codes over nonabelian groups are asymptotically bad. IEEE Trans. Inf. Theory 42(4): 1277-1280 (1996) - 1995
- [j15]Michele Elia:
Are fifth-degree equations over GF(5m) solvable by radicals? Appl. Algebra Eng. Commun. Comput. 7(1): 27-40 (1995) - 1993
- [j14]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): 523-533 (1993) - 1992
- [j13]Michele Elia, Ezio Biglieri:
The Generating Groups of Geometrically Uniform Spherical Signal Sets. Appl. Algebra Eng. Commun. Comput. 3: 163-181 (1992) - 1990
- [c2]Michele Elia, Giorgio Taricco:
A note on automorphism groups of codes and symbol error probability computation. EUROCODE 1990: 6-20
1980 – 1989
- 1989
- [j12]Ezio Biglieri, Michele Elia, Letizia Lopresti:
The optimal linear receiving filter for digital transmission over nonlinear channels. IEEE Trans. Inf. Theory 35(3): 620-625 (1989) - 1988
- [j11]Ezio Biglieri, Michele Elia:
Multidimensional modulation and coding for band-limited digital channels. IEEE Trans. Inf. Theory 34(4): 803-809 (1988) - 1987
- [j10]Michele Elia:
Algebraic decoding of the (23, 12, 7) Golay code. IEEE Trans. Inf. Theory 33(1): 150-151 (1987) - 1986
- [j9]Michele Elia:
On the non-existence of Barker sequences. Comb. 6(3): 275-278 (1986) - 1985
- [j8]Michele Elia, Giancarlo Prati:
On the complete decoding of binary linear codes. IEEE Trans. Inf. Theory 31(4): 518-520 (1985) - 1984
- [j7]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): 29-42 (1984) - [j6]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): 42-50 (1984) - 1983
- [j5]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): 63-73 (1983) - [j4]Michele Elia:
Some results on the existence of binary linear codes. IEEE Trans. Inf. Theory 29(6): 933-934 (1983)
1970 – 1979
- 1976
- [j3]Ezio Biglieri, Michele Elia:
Cyclic-group codes for the Gaussian channel (Corresp.). IEEE Trans. Inf. Theory 22(5): 624-629 (1976) - [j2]Ezio Biglieri, Michele Elia:
Optimum permutation modulation codes and their asymptotic performance (Corresp.). IEEE Trans. Inf. Theory 22(6): 751-753 (1976) - 1975
- [c1]Renato de Mori, Michele Elia, Angelo Serra:
Minimization methods for macrocellular arithmetic networks. IEEE Symposium on Computer Arithmetic 1975: 232-240 - 1972
- [j1]Ezio Biglieri, Michele Elia:
On the existence of group codes for the Gaussian channel. IEEE Trans. Inf. Theory 18(3): 399-402 (1972)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
