Sciweavers

29 search results - page 2 / 6
» Joint iterative decoding of LDPC codes for channels with mem...
Sort
View
ICC
2009
IEEE
146views Communications» more  ICC 2009»
13 years 3 months ago
On Construction of Moderate-Length LDPC Codes over Correlated Erasure Channels
The design of moderate-length erasure correcting low-density parity-check (LDPC) codes over correlated erasure channels is considered. Although the asymptotic LDPC code design rema...
Gianluigi Liva, Balázs Matuz, Zoltán...
CORR
2010
Springer
261views Education» more  CORR 2010»
13 years 2 months ago
Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel
In this paper, we show that over the binary erasure channel, Quasi-Cyclic LDPC codes can efficiently accommodate the hybrid iterative/ML decoding. We demonstrate that the quasicycl...
Mathieu Cunche, Valentin Savin, Vincent Roca
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 5 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
VTC
2007
IEEE
106views Communications» more  VTC 2007»
13 years 11 months ago
Analysis and Design of Dirty Paper Coding by Transformation of Noise
— We design a coding scheme for Costa’s dirty paper coding (DPC) [6] using a channel and a shaping code. We show that by transforming the channel noise distribution the DPC cha...
Young-Seung Lee, Sae-Young Chung
CORR
2006
Springer
96views Education» more  CORR 2006»
13 years 5 months ago
Upper Bounding the Performance of Arbitrary Finite LDPC Codes on Binary Erasure Channels
Assuming iterative decoding for binary erasure channels (BECs), a novel tree-based technique for upper bounding the bit error rates (BERs) of arbitrary, finite low-density parity-c...
Chih-Chun Wang, Sanjeev R. Kulkarni, H. Vincent Po...