A Finite-Length Algorithm for LDPC Codes Without Repeated Edges on the Binary Erasure
Channel Page 1 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 1 …

This paper deals with the irregular binary low-density parity-check (LDPC) codes with
constituent single parity check (SPC) codes and erasurecorrecting iterative low-complex …

A new method for estimating the number of errors guaranteed to be corrected by a low-
density parity-check code is proposed. The method is obtained by analyzing edges with …

This paper investigates decoding of low-density parity-check (LDPC) codes over the binary
erasure channel (BEC). We study the iterative and maximum-likelihood (ML) decoding of …

This paper presents a new improved decoding algorithm for low-density parity-check
(LDPC) codes over the binary erasure channel (BEC). The proposed algorithm combines …

We generalize the method for computing the number of errors correctable by a low-density
parity-check (LDPC) code in a binary symmetric channel, which was proposed by VV …

Low-density parity-check (LDPC) codes can be constructed using constituent block codes
other than single parity-check (SPC) codes. This paper considers random LDPC codes with …

(in English) Decoding performance of LDPC (Low-Density Parity-Check) codes over a
binary erasure channel (BEC) is highly dependent on the degree distributions of the Tanner …

The performance of low-density parity-check (LDPC) codes over the binary erasure channel
for a low erasure probability is limited by small stopping sets. The frame error rate over the …

The authors show that a popular way of constructing quasi-cyclic low-density parity check
(LDPC) codes is a special case of a construction which is common in graph theory and …