The relation between parity-check matrices of quasi-cyclic (QC) low-density parity-check
(LDPC) codes and biadjacency matrices of bipartite graphs supports searching for powerful …

Quasi-cyclic (QC) low-density parity-check (LDPC) codes form an important subclass of
LDPC codes. These codes have encoding advantage over other types of LDPC codes. This …

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 …

In this letter, we consider two problems associated with quasi-cyclic low-density parity-check
(QC-LDPC) codes. The first is how to extend the code length of a QC-LDPC code without …

The BER performance of presented quasi-cyclic (QC) low-density parity-check (LDPC)
codes is not good as that of randomly constructed LDPC codes, while the lack of structure of …

Constructions of regular and irregular LDPC codes using Ramanujan graphs and ideas from
Margulis Page 1 II a ISIT2001, Washington, DC, June 24-29, 2001 Constructions of Regular and …

This correspondence presents a method for constructing structured regular low-density
parity-check (LDPC) codes based on a special type of combinatoric designs, known as …

For a given block length sequences of the underlying Tanner graph (TG), the short circles of
low-density parity check (LDPC) codes can have considerable variation in performance. By …

We present a new class of quasi-cyclic low density parity check (QC-LDPC) codes, whose
quasi-cyclic nature makes them attractive for implementation. Both regular and irregular QC …

This letter presents a systematic and recursive method to construct good low-density parity-
check (LDPC) codes, especially those with high rate. The proposed method uses a parity …