Show simple item record

dc.contributor.advisorVasic, Baneen
dc.contributor.advisorMarcellin, Michael W.en
dc.contributor.authorChilappagari, Shashi Kiran
dc.contributor.authorNguyen, Dung Viet
dc.date.accessioned2016-04-20T23:33:07Zen
dc.date.available2016-04-20T23:33:07Zen
dc.date.issued2008-10en
dc.identifier.issn0884-5123en
dc.identifier.issn0074-9079en
dc.identifier.urihttp://hdl.handle.net/10150/606241en
dc.descriptionITC/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, Californiaen_US
dc.description.abstractIn 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.sponsorshipInternational Foundation for Telemeteringen
dc.language.isoen_USen
dc.publisherInternational Foundation for Telemeteringen
dc.relation.urlhttp://www.telemetry.org/en
dc.rightsCopyright © held by the author; distribution rights International Foundation for Telemeteringen
dc.titleOn Guaranteed Error Correction Capability of GLDPC Codesen_US
dc.typetexten
dc.typeProceedingsen
dc.contributor.departmentUniversity of Arizonaen
dc.identifier.journalInternational Telemetering Conference Proceedingsen
dc.description.collectioninformationProceedings 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.dateFOA2018-09-11T09:13:28Z
html.description.abstractIn 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.


Files in this item

Thumbnail
Name:
ITC_2008_08-21-05.pdf
Size:
246.4Kb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record