On guaranteed error correction capability of GLDPC codes

Shashi Kiran Chilappagari, Dung Viet Nguyen, Bane Vasic, Michael W. Marcellin

Research output: Contribution to journalConference articlepeer-review


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.

Original languageEnglish (US)
JournalProceedings of the International Telemetering Conference
StatePublished - 2008
Event44th Annual International Telemetering Conference and Technical Exhibition - Telemetry: Measure, Move, Record, Analyze...We Do It All, ITC/USA, 2008 - San Diego, CA, United States
Duration: Oct 27 2008Oct 30 2008

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Instrumentation
  • Computer Networks and Communications
  • Signal Processing


Dive into the research topics of 'On guaranteed error correction capability of GLDPC codes'. Together they form a unique fingerprint.

Cite this