We propose a general method for constructing Tanner graphs having a large girth by
establishing edges or connections between symbol and check nodes in an edge-by-edge …

We propose a general method for constructing Tanner (1981) graphs with large girth by
progressively establishing edges or connections between symbol and check nodes in an …

An approach is provided for a method of encoding structure Low Density Parity Check
(LDPC) codes. Memory storing information representing a structured parity check matrix of …

Two algebraic methods for systematic construction of structured regular and irregular low-
density parity-check (LDPC) codes with girth of at least six and good minimum distances are …

The present invention encompasses a method for determin ing values for parity check bits
(p1,..., p,) based on a current symbol Set (S,..., S.). The method comprises the Steps of …

This book describes the fundamentals of cryptographic primitives based on quasi-cyclic low-
density parity-check (QC-LDPC) codes, with a special focus on the use of these codes in …

This paper introduces a family of error-correcting codes called zigzag codes. A zigzag code
is described by a highly structured zigzag graph. Due to the structural properties of the …

We introduce an ensemble of quasi-regular low-density parity check error control codes we
call/spl pi/-rotation LDPC codes. These codes are completely defined by a single …

An approach is provided for bit labeling of a signal constellation. A transmitter generates
encoded signals using, according to one embodiment, a structured parity check matrix of a …

This paper is concerned with a family of concatenated tree (CT) codes. CT codes are special
low-density parity check (LDPC) codes consisting of several trees with large spans. They …