Error Correction Capability of Column-Weight-Three LDPC Codes Under the Gallager A Algorithm—Part II
Name:
Error correction capability of ...
Size:
774.4Kb
Format:
PDF
Description:
Final Accepted Manuscript
Affiliation
Univ Arizona, Dept Elect & Comp EngnIssue Date
2010-05-18
Metadata
Show full item recordPublisher
IEEECitation
S. K. Chilappagari, D. V. Nguyen, B. Vasic and M. W. Marcellin, "Error Correction Capability of Column-Weight-Three LDPC Codes Under the Gallager A Algorithm—Part II," in IEEE Transactions on Information Theory, vol. 56, no. 6, pp. 2626-2639, June 2010, doi: 10.1109/TIT.2010.2046203.Rights
Copyright © 2010 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
The relation between the girth and the error correction capability of column-weight-three LDPC codes under the Gallager A algorithm is investigated. It is shown that a column-weight-three LDPC code with Tanner graph of girth g ¿ 10 can correct all error patterns with up to (g /2-1) errors in at most g /2 iterations of the Gallager A algorithm. For codes with Tanner graphs of girth g ¿ 8, it is shown that girth alone cannot guarantee correction of all error patterns with up to (g /2-1) errors under the Gallager A algorithm. Sufficient conditions to correct (g /2-1) errors are then established by studying trapping sets.ISSN
0018-9448Version
Final accepted manuscriptae974a485f413a2113503eed53cd6c53
10.1109/tit.2010.2046203