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 propose a general method for constructing Tanner graphs having a large girth by
establishing edges or connections between symbol and check nodes in an edge-by-edge …

In this paper, we study the cycle structure of quasi-cyclic (QC) low-density parity-check
(LDPC) codes with the goal of obtaining the shortest code with a given degree distribution …

This paper revisits the connection between the girth of a protograph-based LDPC code
given by a parity-check matrix and the properties of powers of the product between the …

In this paper, we study the relationships between the girth of the Tanner graph of a quasi-
cyclic (QC) protograph low-density parity-check (LDPC) code, the lifting degree, and the size …

This article presents a graph-theoretic method for constructing low-density parity-check
(LDPC) codes from connected graphs without the requirement of large girth. This method is …

Quasi-cyclic low-density parity-check (QC-LDPC) codes based on protographs are of great
interest to code designers because analysis and implementation are facilitated by the …

Bipartite graphs of bit nodes and parity check nodes arise as Tanner graphs corresponding
to low density parity check codes. Given graph parameters such as the number of check …

We present a method to construct low-density parity-check (LDPC) codes with low error
floors on the binary symmetric channel. Codes are constructed so that their Tanner graphs …

LDPC codes based on multi-edge protographs potentially have larger minimum distances
compared to their counterparts, single-edge protographs. However, considering different …