Error correction capability of column-weight-three LDPC codes under the Gallager A algorithm-part II

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

Research output: Contribution to journalArticle

12 Scopus citations

Abstract

The relation between the girth and the error correction capability of column-weight-three LDPC codes under the Gallager A algorithm is investigated. It is shown that a column-weightthree LDPC code with Tanner graph of girth g ≥ 10 can correct all error patterns with up to (g/2-1) errors in at most g/2 iterations of the Gallager A algorithm. For codes with Tanner graphs of girth g le; 8, it is shown that girth alone cannot guarantee correction of all error patterns with up to (g/2-1) errors under the Gallager A algorithm. Sufficient conditions to correct (g/2-1) errors are then established by studying trapping sets.

Original languageEnglish (US)
Article number2046203
Pages (from-to)2626-2639
Number of pages14
JournalIEEE Transactions on Information Theory
Volume56
Issue number6
DOIs
StatePublished - Jun 1 2010

Keywords

  • Error floor
  • Gallager A algorithm
  • Girth
  • Low-density parity-check (LDPC) codes
  • Trapping sets

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint Dive into the research topics of 'Error correction capability of column-weight-three LDPC codes under the Gallager A algorithm-part II'. Together they form a unique fingerprint.

  • Cite this