On the guaranteed error correction capability of LDPC codes

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

We investigate the relation between the girth and the guaranteed error correction capability of γ-left regular LDPC codes when decoded using the bit flipping (serial and parallel) algorithms. A lower bound on the number of variable nodes which expand by a factor of at least 3γ/4 is found based on the Moore bound. An upper bound on the guaranteed correction capability is established by studying the sizes of smallest possible trapping sets.

Original languageEnglish (US)
Title of host publicationProceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Pages434-438
Number of pages5
DOIs
StatePublished - 2008
Event2008 IEEE International Symposium on Information Theory, ISIT 2008 - Toronto, ON, Canada
Duration: Jul 6 2008Jul 11 2008

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101

Other

Other2008 IEEE International Symposium on Information Theory, ISIT 2008
Country/TerritoryCanada
CityToronto, ON
Period7/6/087/11/08

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint

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

Cite this