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 …

There have been lots of efforts on the construction of quasi-cyclic (QC) low-density parity-
check (LDPC) codes with large girth. However, most of them focus on protographs with …

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 …

We propose a systematic design of protograph-based quasi-cyclic (QC) low-density parity-
check (LDPC) codes with low error floor. We first characterize the trapping sets of such …

The parity-check matrix of a quasi-cyclic low-density parity-check (QC-LDPC) code can be
compactly represented by a polynomial parity-check matrix. By using this compact …

This paper presents a simple and very flexible method for constructing quasi-cyclic (QC) low
density paritycheck (LDPC) codes based on finite fields. The code construction is based on …

In this paper, we investigate the cycle properties of quasi-cyclic low-density parity-check (QC-
LDPC) codes. Using the sequence representation of a parity-check matrix for a QC-LDPC …

A quasi-cyclic (QC) low-density parity-check (LDPC) code can be viewed as the protograph
code with circulant permutation matrices (or circulants). In this correspondence, we find all …

We present an approach to designing capacity-approaching high-girth low-density parity-
check (LDPC) codes that are friendly to hardware implementation, and compatible with …

In this paper, we analyze some cycle properties of quasi-cyclic low-density parity-check (QC-
LDPC) codes and show that the girth of a QC-LDPC code is upper bounded by a certain …