We develop improved algorithms to construct good low-density parity-check codes that
approach the Shannon limit very closely. For rate 1/2, the best code found has a threshold …

A low-density parity-check code is a code specified by a parity-check matrix with the
following properties: each column contains a small fixed number j\geq 3 of l's and each row …

Binary low density parity check (LDPC) codes have been shown to have near Shannon limit
performance when decoded using a probabilistic decoding algorithm. The analogous codes …

For a given block length and given degree sequences of the underlying Tanner graph (TG),
the ensemble of short low-density parity-check (LDPC) codes can have considerable …

We consider the problem of rate-compatible puncturing of low-density parity-check (LDPC)
codes over additive white Gaussian noise (AWGN) channels. In previous work, it was shown …

The low-density parity check codes whose performance is closest to the Shannon limit are"
Gallager codes" based on irregular graphs. We compare alternative methods for …

We introduce a new one-dimensional (1-D) analysis of low-density parity-check (LDPC)
codes on additive white Gaussian noise channels which is significantly more accurate than …

We construct new families of error-correcting codes based on Gallager's (1973) low-density
parity-check codes. We improve on Gallager's results by introducing irregular parity-check …

A numerical method has been presented to determine the noise thresholds of low density
parity-check (LDPC) codes that employ the message passing decoding algorithm on the …

In this correspondence, we consider puncturing of low-density parity-check (LDPC) codes
for additive white Gaussian noise (AWGN) channels. We show that good puncturing patterns …