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 …

Quasi-cyclic (QC) low-density parity-check (LDPC) codes form an important subclass of
LDPC codes. These codes have encoding advantage over other types of LDPC codes. This …

Iterative error correction codes have found widespread application in cellular
communications, digital video broadcasting and wireless LANs. This self-contained …

Most coding theory experts date the origin of the subject with the 1948 publication of A
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …

In the late 1950s and early 1960s, finite fields were successfully used to construct linear
block codes, especially cyclic codes, with large minimum distances for hard-decision …

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 …

This correspondence presents a method for constructing structured regular low-density
parity-check (LDPC) codes based on a special type of combinatoric designs, known as …

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 …

Distributed storage systems need to store data redundantly in order to provide some fault-
tolerance and guarantee system reliability. Different coding techniques have been proposed …

Lifted maximum rank distance (MRD) codes, which are constant dimension codes, are
considered. It is shown that a lifted MRD code can be represented in such a way that it forms …