TIT
2010
13 years 7 months ago
2010
Abstract--An iterative decoding threshold analysis for terminated regular LDPC convolutional (LDPCC) codes is presented. Using density evolution techniques, the convergence behavio...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
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...
TIT
2008
13 years 11 months ago
2008
There is a fundamental relationship between belief propagation and maximum a posteriori decoding. A decoding algorithm, which we call the Maxwell decoder, is introduced and provide...
TIT
2002
14 years 7 days ago
2002
In this paper, we are concerned with the finite-length analysis of low-density parity-check (LDPC) codes when used over the binary erasure channel (BEC). The main result is an expr...
CORR
2004
Springer
14 years 14 days ago
2004
Springer
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bi...
CORR
2006
Springer
14 years 19 days ago
2006
Springer
The asymptotic iterative decoding performances of low-density parity-check (LDPC) codes using min-sum (MS) and sum-product (SP) decoding algorithms on memoryless binary-input outp...
VTC
2007
IEEE
14 years 6 months ago
2007
IEEE
– Luby Transform codes (LT) were originally designed for the Binary Erasure Channel (BEC) encountered owing to randomly dropped packets in the statistical multiplexing aided Inte...
GLOBECOM
2008
IEEE
14 years 7 months ago
2008
IEEE
—In this contribution, duals of fountain codes are introduced and their use for lossy source compression is investigated. It is shown both theoretically and experimentally that t...