Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Giacomo Ricciutelli

dblp:144/7385 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2019
0000-0002-0300-5785ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › error probability analysis
block error probability
0.412019
Analysis of the Block Error Probability of Concatenated Polar Code Ensembles · IEEE Trans. Commun. 2019
Coding theory › channel coding › polar codes
concatenated polar codes
0.412019
Analysis of the Block Error Probability of Concatenated Polar Code Ensembles · IEEE Trans. Commun. 2019
Coding theory › error-correcting codes
error probability analysis
0.412019
Analysis of the Block Error Probability of Concatenated Polar Code Ensembles · IEEE Trans. Commun. 2019
Coding theory › channel coding
polar codes
0.412019
Analysis of the Block Error Probability of Concatenated Polar Code Ensembles · IEEE Trans. Commun. 2019
Coding theory › error-correcting codes › error detection
cyclic redundancy check
0.112019
Analysis of the Block Error Probability of Concatenated Polar Code Ensembles · IEEE Trans. Commun. 2019

Methods — techniques the papers use, named apart from their topics

uniform interleaver · 0.4successive cancellation list decoding · 0.4monte carlo simulation · 0.4maximum-likelihood decoding · 0.4
YearPublicationVenuePosition
2019 Analysis of the Block Error Probability of Concatenated Polar Code Ensembles
abstract
In this paper, we provide an analysis of the performance of concatenation of polar codes with outer cyclic redundancy check (CRC) codes, separated by an interleaver, in the short and moderate block length regimes. The analysis addresses maximum likelihood decoding as a proxy to the code performance under successive cancellation list decoding. The analysis is carried out by introducing the concatenated polar code (CPC) ensembles, whose distance properties can be analyzed (for sufficiently short block lengths) by means of the uniform interleaver approach. At moderate block lengths, we resort to the Monte Carlo simulations. Results show that if the inner polar code possesses a low minimum distance and the outer CRC code has a sufficiently large amount of redundancy, then the choice of the outer code generator polynomial and the interleaver may yield to a large variability in the performance of the resulting CPC.
Giacomo Ricciutelli, Thomas Jerkovits, Marco Baldi, Franco Chiaraluce, Gianluigi Liva
IEEE Trans. Commun.1
2017 On the error probability of short concatenated polar and cyclic codes with interleaving
abstract
In this paper, we study of the performance of the concatenation of a short polar code with an outer binary linear block code from a distance spectrum viewpoint. Our analysis targets the case where an outer cyclic code is employed together with an inner systematic polar code. A concatenated code ensemble is defined placing an interleaver at the input of the polar encoder. The introduced ensemble allows deriving bounds on the achievable error rates under maximum likelihood decoding, by applying the union bound to the (expurgated) average weight enumerators. The analysis suggests the need of careful optimization of the outer code, to attain low error floors. We also investigate the performance of a number of randomly chosen interleavers, with the aim to discuss the dispersion around the ensemble.
Giacomo Ricciutelli, Marco Baldi, Franco Chiaraluce, Gianluigi Liva
ISIT1
2016 On the error detection capability of combined LDPC and CRC codes for space telecommand transmissions
abstract
We present a method for estimating the undetected error rate when a cyclic redundancy check (CRC) is performed on the output of the decoder of short low-density parity-check (LDPC) codes. This system is of interest for telecommand links, where new LDPC codes have been designed for updating the current standard. We show that these new LDPC codes combined with CRC are adequate for complying with the stringent requirements of this kind of transmissions in terms of error detection.
Marco Baldi, Nicola Maturo, Giacomo Ricciutelli, Franco Chiaraluce
ISCC3