Low-density parity-check (LDPC) codes are forward error-correction codes, first proposed in
the 1962 PhD thesis of Gallager at MIT. At the time, their incredible potential remained …

(57) ABSTRACT A set of irregular LDPC (Low Density Parity Check) codes having a pseudo-
random structure and low encoding com plexity. A block-cyclic LDPC code has an irregular …

This paper develops codes suitable for iterative decoding using the sum-product algorithm.
By considering a large class of combinatorial structures, known as partial geometries, we …

This article develops a general method for constructing entanglement-assisted quantum low-
density parity-check (LDPC) codes, which is based on combinatorial design theory. Explicit …

For a high-rate case, it is difficult to randomly construct good low-density parity-check
(LDPC) codes of short and moderate lengths because their Tanner graphs are prone to …

This correspondence proposes a jointly-designed quasi-cyclic (QC) low-density parity-check
(LDPC)-coded multi-relay cooperation with a destination node realized by multiple receive …

The purpose of writing this book is primarily to make the subject of coding theory easy for the
senior or graduate students who possess a thorough understanding of digital arithmetic …

We use the theory of finite classical generalized polygons to derive and study low-density
parity-check (LDPC) codes. The Tanner graph of a generalized polygon LDPC code is …

Earlier regular low-density parity-check (LDPC) codes have been constructed using
resolvable combinatorial designs. Here we have constructed LDPC codes from α-resolvable …

In this paper low-density parity-check (LDPC) codes are designed for burst erasure
channels. Firstly, lower bounds for the maximum length erasure burst that can always be …