56 search results - page 2 / 12 » Upper bounds on the rate of LDPC Codes |
TIT
2002
13 years 4 months ago
2002
We consider Gallager's soft decoding (belief propagation) algorithm for decoding low density parity check (LDPC) codes, when applied to an arbitrary binary-input symmetric-ou...
DCC
2005
IEEE
13 years 6 months ago
2005
IEEE
We derive an upper bound on the average MAP decoding error probability of random linear SW codes for arbitrary correlated stationary memoryless sources defined on Galois fields....
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— A ‘queued-code’ is a novel code which allows for instantaneous rate adaptation, to match the current channel state information (CSI), assumed known to the transmitter. Prev...
TIT
2008
13 years 4 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...
TIT
2002
13 years 4 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...