Sciweavers

4 search results - page 1 / 1
» Low-Complexity LDPC Codes with Near-Optimum Performance over...
Sort
View
CORR
2008
Springer
117views Education» more  CORR 2008»
13 years 3 months ago
Low-Complexity LDPC Codes with Near-Optimum Performance over the BEC
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...
Enrico Paolini, Gianluigi Liva, Michela Varrella, ...
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 4 months ago
Construction of Near-Optimum Burst Erasure Correcting Low-Density Parity-Check Codes
In this paper, a simple and effective tool for the design of low-density parity-check (LDPC) codes for iterative correction of bursts of erasures is presented. The design method co...
Enrico Paolini, Marco Chiani
GLOBECOM
2006
IEEE
13 years 10 months ago
Application of Nonbinary LDPC Codes for Communication over Fading Channels Using Higher Order Modulations
Abstract— In this paper, we investigate the application of nonbinary low density parity check (LDPC) codes over Galois field GF(q) for both single-input single-output (SISO) and...
Ronghui Peng, Rong-Rong Chen
TIT
2010
144views Education» more  TIT 2010»
12 years 11 months ago
Generalized and doubly generalized LDPC codes with random component codes for the binary erasure channel
In this paper, a method for the asymptotic analysis of generalized low-density parity-check (GLDPC) codes and doubly generalized low-density parity-check (D-GLDPC) codes over the b...
Enrico Paolini, Marc P. C. Fossorier, Marco Chiani