Error-Correction Capability of Column-Weight-Three LDPC Codes
dc.contributor.author | Chilappagari, Shashi Kiran | |
dc.contributor.author | Vasic, Bane | |
dc.date.accessioned | 2020-07-31T23:43:06Z | |
dc.date.available | 2020-07-31T23:43:06Z | |
dc.date.issued | 2009-04-21 | |
dc.identifier.citation | S. K. Chilappagari and B. Vasic, "Error-Correction Capability of Column-Weight-Three LDPC Codes," in IEEE Transactions on Information Theory, vol. 55, no. 5, pp. 2055-2061, May 2009, doi: 10.1109/TIT.2009.2015990. | en_US |
dc.identifier.issn | 0018-9448 | |
dc.identifier.doi | 10.1109/tit.2009.2015990 | |
dc.identifier.uri | http://hdl.handle.net/10150/641964 | |
dc.description.abstract | In this paper, the error-correction capability of column-weight-three low-density parity-check (LDPC) codes when decoded using the Gallager A algorithm is investigated. It is proved that a necessary condition for a code to correct all error patterns with up to k ges 5 errors is to avoid cycles of length up to 2k in its Tanner graph. As a consequence of this result, it is shown that given any alpha > 0, exist N such that forall n > N, no code in the ensemble of column-weight-three codes can correct all alphan or fewer errors. The results are extended to the bit flipping algorithms. | en_US |
dc.language.iso | en | en_US |
dc.publisher | IEEE | en_US |
dc.rights | Copyright © 2009 IEEE. | en_US |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en_US |
dc.subject | Error-correction capability | en_US |
dc.subject | Gallager A algorithm | en_US |
dc.subject | Tanner graph | en_US |
dc.subject | trapping sets | en_US |
dc.subject | low-density parity-check (LDPC) codes | en_US |
dc.title | Error-Correction Capability of Column-Weight-Three LDPC Codes | en_US |
dc.type | Article | en_US |
dc.contributor.department | Univ Arizona, Dept Elect & Comp Engn | en_US |
dc.identifier.journal | IEEE Transactions on Information Theory | en_US |
dc.description.collectioninformation | 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. | en_US |
dc.eprint.version | Final accepted manuscript | en_US |
dc.source.journaltitle | IEEE Transactions on Information Theory | |
dc.source.volume | 55 | |
dc.source.issue | 5 | |
dc.source.beginpage | 2055 | |
dc.source.endpage | 2061 | |
refterms.dateFOA | 2020-07-31T23:43:07Z |