Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
AffiliationUniv Arizona, Dept Elect & Comp Engn
MetadataShow full item record
CitationB. Vasic and O. Milenkovic, "Combinatorial constructions of low-density parity-check codes for iterative decoding," in IEEE Transactions on Information Theory, vol. 50, no. 6, pp. 1156-1176, June 2004, doi: 10.1109/TIT.2004.828066.
RightsCopyright © 2004 IEEE
Collection InformationThis item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at firstname.lastname@example.org.
AbstractThis paper introduces several new combinatorial constructions of low-density parity-check (LDPC) codes, in contrast to the prevalent practice of using long, random-like codes. The proposed codes are well structured, and unlike random codes can lend themselves to a very low-complexity implementation. Constructions of regular Gallager codes based on cyclic difference families, cycle-invariant difference sets, and affine 1-configurations are introduced. Several constructions of difference families used for code design are presented, as well as bounds on the minimal distance of the codes based on the concept of a generalized Pasch configuration.
VersionFinal accepted manuscript