On Guaranteed Error Correction Capability of GLDPC Codes
| dc.contributor.advisor | Vasic, Bane | en |
| dc.contributor.advisor | Marcellin, Michael W. | en |
| dc.contributor.author | Chilappagari, Shashi Kiran | |
| dc.contributor.author | Nguyen, Dung Viet | |
| dc.date.accessioned | 2016-04-20T23:33:07Z | en |
| dc.date.available | 2016-04-20T23:33:07Z | en |
| dc.date.issued | 2008-10 | en |
| dc.identifier.issn | 0884-5123 | en |
| dc.identifier.issn | 0074-9079 | en |
| dc.identifier.uri | http://hdl.handle.net/10150/606241 | en |
| dc.description | ITC/USA 2008 Conference Proceedings / The Forty-Fourth Annual International Telemetering Conference and Technical Exhibition / October 27-30, 2008 / Town and Country Resort & Convention Center, San Diego, California | en_US |
| dc.description.abstract | In this paper, it is shown that generalized LDPC codes can correct a linear fraction of errors under the parallel bit flipping algorithm when the underlying Tanner graph is a good expander. A lower bound on the size of variable node sets which have required expansion is established as a function of the column weight of the code, the girth of the Tanner graph and the error correction capability of the sub-code. It is also shown that the bound on the required expansion cannot be improved when the column weight is even by studying a class of trapping sets. An upper bound on the guaranteed error correction capability is found by investigating the size of smallest possible trapping sets. | |
| dc.description.sponsorship | International Foundation for Telemetering | en |
| dc.language.iso | en_US | en |
| dc.publisher | International Foundation for Telemetering | en |
| dc.relation.url | http://www.telemetry.org/ | en |
| dc.rights | Copyright © held by the author; distribution rights International Foundation for Telemetering | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
| dc.title | On Guaranteed Error Correction Capability of GLDPC Codes | en_US |
| dc.type | text | en |
| dc.type | Proceedings | en |
| dc.contributor.department | University of Arizona | en |
| dc.identifier.journal | International Telemetering Conference Proceedings | en |
| dc.description.collectioninformation | Proceedings from the International Telemetering Conference are made available by the International Foundation for Telemetering and the University of Arizona Libraries. Visit http://www.telemetry.org/index.php/contact-us if you have questions about items in this collection. | en |
| refterms.dateFOA | 2018-09-11T09:13:28Z | |
| html.description.abstract | In this paper, it is shown that generalized LDPC codes can correct a linear fraction of errors under the parallel bit flipping algorithm when the underlying Tanner graph is a good expander. A lower bound on the size of variable node sets which have required expansion is established as a function of the column weight of the code, the girth of the Tanner graph and the error correction capability of the sub-code. It is also shown that the bound on the required expansion cannot be improved when the column weight is even by studying a class of trapping sets. An upper bound on the guaranteed error correction capability is found by investigating the size of smallest possible trapping sets. |
