High-Rate Girth-Eight Low-Density Parity-Check Codes on Rectangular Integer Lattices
Name:
High-Rate Girth-Eight Low-Density ...
Size:
528.8Kb
Format:
PDF
Description:
Final Accepted Manuscript
Affiliation
Univ Arizona, Dept Elect & Comp EngnIssue Date
2004-08-30Keywords
combinatorial designserror-control coding
finite geometries
graph girth
iterative decoding
low-density parity-check (LDPC) codes
Metadata
Show full item recordPublisher
IEEECitation
B. Vasic, K. Pedagani and M. Ivkovic, "High-rate girth-eight low-density parity-check codes on rectangular integer lattices," in IEEE Transactions on Communications, vol. 52, no. 8, pp. 1248-1252, Aug. 2004, doi: 10.1109/TCOMM.2004.833037.Rights
Copyright © 2004 IEEE.Collection Information
This 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 repository@u.library.arizona.edu.Abstract
This letter introduces a combinatorial construction of girth-eight high-rate low-density parity-check codes based on integer lattices. The parity-check matrix of a code is defined as a point-line incidence matrix of a 1-configuration based on a rectangular integer lattice, and the girth-eight property is achieved by a judicious selection of sets of parallel lines included in a configuration. A class of codes with a wide range of lengths and column weights is obtained. The resulting matrix of parity checks is an array of circulant matrices.ISSN
0090-6778Version
Final accepted manuscriptae974a485f413a2113503eed53cd6c53
10.1109/tcomm.2004.833037