In this work, the construction of low density parity check codes (LDPCs) from circulant
permutation matrices is investigated. It is shown that such codes can not have a Tanner …

In this correspondence, the construction of low-density parity-check (LDPC) codes from
circulant permutation matrices is investigated. It is shown that such codes cannot have a …

This paper presents a combinatoric method for constructing low density parity check (LDPC)
codes. Two classes of LDPC codes are constructed and they perform well with iterative …

A new method is given to construct low-density parity check codes the graphs of which are of
designed girth. We give examples to illustrate the new method, and also present …

A new approach is proposed for constructing regular low-density parity-check (LDPC) codes
based on tensor product of matrices. In this paper, first a general construction method of …

In this paper we propose a graph‐theoretic method based on linear congruence for
constructing low‐density parity check (LDPC) codes. In this method, we design a connection …

An approach for studying quasi-cyclic codes based on matrix transformations via Fourier
transforms and row and column permutations is presented. These transformations put a …

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 …

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. In this paper, we find all the subgraph patterns of …