Iterative error correction codes have found widespread application in cellular
communications, digital video broadcasting and wireless LANs. This self-contained …

Quasi-cyclic (QC) low-density parity-check (LDPC) codes are an important instance of proto-
graph-based LDPC codes. In this paper we present upper bounds on the minimum …

Protograph-based LDPC and generalized LDPC (G-LDPC) codes have the advantages of a
simple design procedure and highly structured encoders and decoders. The design of such …

We discuss error floor asympotics and present a method for improving the performance of
low-density parity-check (LDPC) codes in the high SNR (error floor) region. The method is …

Alternating direction method of multipliers (ADMM) is an efficient implementation of linear
programming (LP) decoding for low-density parity-check (LDPC) codes. By adding penalty …

In this paper, we propose a new linear programming formulation for the decoding of general
linear block codes. Different from the original formulation given by Feldman, the number of …

This paper presents a unifying framework to construct low-density parity-check (LDPC)
codes with associated Tanner graphs of desired girth. Towards this goal, we highlight the …

We describe a family of instanton-based optimization methods developed recently for the
analysis of the error floors of low-density parity-check (LDPC) codes. Instantons are the most …

This paper presents an FPGA-based implementation of a tri-mode decoder for decoding the
cyclic (4095, 3367) Euclidean geometry LDPC code which has minimum distance 65 and no …

Message-passing iterative decoders for low-density parity-check (LDPC) block codes are
known to be subject to decoding failures due to so-called pseudocodewords. These failures …