most citedLow-Complexity LDPC Codes with Near-Optimum Performance over the BEC

10 citations · 15 across the 5 of their papers we have counts for

collaborators

5 papers

cs.IT2008

Construction of Near-Optimum Burst Erasure Correcting Low-Density Parity-Check Codes

E. Paolini, M. Chiani

In this paper, a simple, general-purpose and effective tool for the design of low-density parity-check (LDPC) codes for iterative correction of bursts of erasures is presented. The…

cs.IT20083 cited

On the Growth Rate of the Weight Distribution of Irregular Doubly-Generalized LDPC Codes

Mark F. Flanagan, Enrico Paolini, Marco Chiani +1

In this paper, an expression for the asymptotic growth rate of the number of small linear-weight codewords of irregular doubly-generalized LDPC (D-GLDPC) codes is derived. The expr…

cs.IT200810 cited

Low-Complexity LDPC Codes with Near-Optimum Performance over the BEC

Enrico Paolini, Gianluigi Liva, Michela Varrella +2

Recent works showed how low-density parity-check (LDPC) erasure correcting codes, under maximum likelihood (ML) decoding, are capable of tightly approaching the performance of an i…

cs.IT2007

A Class of LDPC Erasure Distributions with Closed-Form Threshold Expression

E. Paolini, M. Chiani

In this paper, a family of low-density parity-check (LDPC) degree distributions, whose decoding threshold on the binary erasure channel (BEC) admits a simple closed form, is presen…

cs.IT20072 cited

Pragmatic Space-Time Trellis Codes for Block Fading Channels

Marco Chiani, Andrea Conti, Velio Tralli

A pragmatic approach for the construction of space-time codes over block fading channels is investigated. The approach consists in using common convolutional encoders and Viterbi d…