In this paper we present a class of structured low-density parity-check (LDPC) codes from
affine permutation matrices, called the APM-LDPC codes, which are a generalization of …

Low‐density parity‐check (LDPC) codes from affine permutation matrices, called APM‐
LDPC codes, are a class of LDPC codes whose parity‐check matrices consist of zero …

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 …

Low-density parity-check (LDPC) codes based on affine permutation matrices, APM-LDPC
codes, have been attracted recently, because of some advantages rather than QC-LDPC …

In this paper we present a class of algebraically structured quasi-cyclic (QC) low-density
parity-check (LDPC) codes which have lower encoding complexity than randomly …

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 …

Recently, a class of low‐density parity‐check (LDPC) codes from affine permutation
matrices, called APM‐LDPC codes, have attracted because of some advantages rather than …

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 …

In this correspondence we present a special class of quasi-cyclic low-density parity-check
(QC-LDPC) codes, called block-type LDPC (B-LDPC) codes, which have an efficient …

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 …