default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiuliano Garrammone
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[i1]Francisco Lázaro, Giuliano Garrammone, Gianluigi Liva:
Parallel Concatenation of Non-Binary Linear Random Fountain Codes with Maximum Distance Separable Codes. CoRR abs/1909.08545 (2019)- 2017
- [j6]Giuliano Garrammone
, David Declercq, Marc P. C. Fossorier:
Weight Distributions of Non-Binary Multi-Edge Type LDPC Code Ensembles: Analysis and Efficient Evaluation. IEEE Trans. Inf. Theory 63(3): 1463-1475 (2017) - 2015
- [b1]Giuliano Garrammone:
Non-Binary Codes with Applications to Satellite and Space Communications. Technical University Munich, Verlag Dr. Hut 2015, ISBN 978-3-8439-2118-3, pp. 1-205 - [j5]Giuliano Garrammone, Enrico Paolini, Balázs Matuz, Gianluigi Liva:
Non-Binary LDPC Erasure Codes With Separated Low-Degree Variable Nodes. IEEE Trans. Commun. 63(11): 3937-3949 (2015) - [c6]Giuliano Garrammone, David Declercq, Marc P. C. Fossorier:
Weight distributions of non-binary multi-edge type LDPC code ensembles. ISIT 2015: 2875-2879 - 2014
- [j4]Giuliano Garrammone, Tomaso de Cola, Balázs Matuz, Gianluigi Liva:
Recent findings on erasure codes for space communications. Int. J. Satell. Commun. Netw. 32(3): 201-211 (2014) - [c5]Giuliano Garrammone, Enrico Paolini, Marco Chiani:
Spectral shape of non-binary LDPC code ensembles with separated variable nodes. ISITA 2014: 1-5 - 2013
- [j3]Giuliano Garrammone:
On Decoding Complexity of Reed-Solomon Codes on the Packet Erasure Channel. IEEE Commun. Lett. 17(4): 773-776 (2013) - [j2]Birgit Schotsch, Giuliano Garrammone, Peter Vary:
Analysis of LT Codes over Finite Fields under Optimal Erasure Decoding. IEEE Commun. Lett. 17(9): 1826-1829 (2013) - [j1]Francisco Lázaro Blasco, Giuliano Garrammone, Gianluigi Liva:
Parallel Concatenation of Non-Binary Linear Random Fountain Codes with Maximum Distance Separable Codes. IEEE Trans. Commun. 61(10): 4067-4075 (2013) - [c4]Giuliano Garrammone, Enrico Paolini, Balázs Matuz, Gianluigi Liva, Marco Chiani:
Non-binary low-density parity-check codes for the q-ary erasure channel. ICC 2013: 3258-3263 - [c3]Raffaele Soloperto, Giuliano Garrammone, Gianluigi Liva, Oreste Andrisano:
Quasi-Cyclic Doubly Generalized LDPC Codes. VTC Spring 2013: 1-5 - 2012
- [c2]Giuliano Garrammone, Tomaso de Cola, Balázs Matuz, Gianluigi Liva:
Erasure codes for space communications: Recent findings and new challenges. ASMS/SPSC 2012: 29-35 - 2010
- [c1]Giuliano Garrammone, Balázs Matuz:
Short Erasure Correcting LDPC IRA Codes over GF(q). GLOBECOM 2010: 1-5
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-05-08 21:41 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:
