5 search results - page 1 / 1 » Capacity-achieving ensembles for the binary erasure channel ... |
CORR
2004
Springer
13 years 8 months ago
2004
Springer
CORR
2004
Springer
13 years 8 months 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...
TIT
2002
13 years 8 months 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...
TIT
2008
13 years 8 months ago
2008
In this paper, redundant random ensembles are defined and their average stopping set (SS) weight distributions are analyzed. A redundant random ensemble consists of a set of binar...
TCOM
2010
13 years 7 months ago
2010
—This paper is concerned with a simple binary erasure-recovery coding scheme that falls into the family of socalled semi-random low-density-parity-check (SR-LDPC) codes. Based on...