Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
Top Cited Papers
- 26 July 2004
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 50 (8) , 1788-1793
- https://doi.org/10.1109/tit.2004.831841
Abstract
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 Tanner graph representation with girth larger than 12, and a relatively mild necessary and sufficient condition for the code to have a girth of 6, 8,10, or 12 is derived. These results suggest that families of LDPC codes with such girth values are relatively easy to obtain and, consequently, additional parameters such as the minimum distance or the number of redundant check sums should be considered. To this end, a necessary condition for the codes investigated to reach their maximum possible minimum Hamming distance is proposed.Keywords
This publication has 16 references indexed in Scilit:
- Weaknesses of Margulis and Ramanujan-Margulis Low-Density Parity-Check CodesElectronic Notes in Theoretical Computer Science, 2003
- Irregular progressive edge-growth (PEG) Tanner graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Irregular codes from regular graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Codes for iterative decoding from partial geometriesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Low-density parity-check codes based on finite geometries: a rediscovery and new resultsIEEE Transactions on Information Theory, 2001
- Design of capacity-approaching irregular low-density parity-check codesIEEE Transactions on Information Theory, 2001
- Efficient erasure correcting codesIEEE Transactions on Information Theory, 2001
- Iterative decoding of one-step majority logic deductible codes based on belief propagationIEEE Transactions on Communications, 2000
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981