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 …

The class of low-density parity-check (LDPC) codes is attractive, since such codes can be
decoded using practical message-passing algorithms, and their performance is known to …

In this correspondence, we present a method for constructing sparse matrices that have a
compact description and whose associated bipartite graphs have large girth. Based on an …

For a prime q and an integer j/spl les/q, the code C (q, j) is a class of low-density parity-check
(LDPC) codes from array codes which has a nice algebraic structure. In this …

In this paper, we investigate the attainable performance of quasi-cyclic (QC) protograph low-
density parity-check (LDPC) codes for transmission over both additive white Gaussian noise …

The goals of this article are twofold:(1) to provide a brief tutorial of the application of low-
density parity check (LDPC) codes for partial response (PR) channels under the framework …

In this paper, we propose a linear complexity encoding method for arbitrary LDPC codes.
We start from a simple graph-based encoding method¿ label-and-decide.¿ We prove that …

In this paper, we study the minimum/stop** distance of array low-density parity-check
(LDPC) codes. An array LDPC code is a quasi-cyclic LDPC code specified by two integers q …

Error correcting codes represent a widely applied technique for assuring reliable electronic
communications and data recording. Although often some codes are introduced without the …

There is a concept in graph theory known as a chord which has not been considered before
in relation to trap** sets of Tanner graphs. A chord of a cycle is an edge outside the cycle …