Girth of the tanner graph and 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

2 Scopus citations

Abstract

We investigate the relation between the girth and the guaranteed error correction capability of γ-left regular LDPC codes. For column-weight-three codes, we give upper and lower bounds on the number of errors correctable by the Gallager A algorithm. For higher column weight codes, we find the number of variable nodes which are guaranteed to expand by a factor of at least 3γ/4, hence giving a lower bound on the guaranteed correction capability under the bit flipping (serial and parallel) algorithms. We also establish upper bounds by studying the sizes of smallest possible trapping sets.

Original languageEnglish (US)
Title of host publication46th Annual Allerton Conference on Communication, Control, and Computing
Pages1238-1245
Number of pages8
DOIs
StatePublished - Dec 1 2008
Event46th Annual Allerton Conference on Communication, Control, and Computing - Monticello, IL, United States
Duration: Sep 24 2008Sep 26 2008

Publication series

Name46th Annual Allerton Conference on Communication, Control, and Computing

Other

Other46th Annual Allerton Conference on Communication, Control, and Computing
CountryUnited States
CityMonticello, IL
Period9/24/089/26/08

Keywords

  • Bit flipping algorithms
  • Error correction capability
  • Gallager a algorithm
  • Low-density parity-check codes

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software
  • Control and Systems Engineering
  • Communication

Fingerprint Dive into the research topics of 'Girth of the tanner graph and error correction capability of LDPC codes'. Together they form a unique fingerprint.

  • Cite this

    Chilappagari, S. K., Nguyen, D. V., Vasić, B., & Marcellin, M. W. (2008). Girth of the tanner graph and error correction capability of LDPC codes. In 46th Annual Allerton Conference on Communication, Control, and Computing (pp. 1238-1245). [4797702] (46th Annual Allerton Conference on Communication, Control, and Computing). https://doi.org/10.1109/ALLERTON.2008.4797702