Guaranteed error correction capability of codes on graphs

Shashi Kiran Chilappagari, Bane Vasic, Michael W. Marcellin

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

4 Scopus citations

Abstract

The guaranteed error correction capability of left regular LDPC codes under different hard decision decision algorithms is investigated. A summary of recent results relating the column weight and girth of the Tanner graph to the guaranteed error correction capability is provided. The intuition behind expander based arguments and their potential to derive new results for column-weight-three codes is provided.

Original languageEnglish (US)
Title of host publicationInformation Theory and Applications Workshop, ITA 2009
Pages50-55
Number of pages6
DOIs
StatePublished - Sep 25 2009
EventInformation Theory and Applications Workshop, ITA 2009 - San Diego, CA, United States
Duration: Feb 8 2009Feb 13 2009

Publication series

NameInformation Theory and Applications Workshop, ITA 2009

Other

OtherInformation Theory and Applications Workshop, ITA 2009
CountryUnited States
CitySan Diego, CA
Period2/8/092/13/09

    Fingerprint

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Cite this

Chilappagari, S. K., Vasic, B., & Marcellin, M. W. (2009). Guaranteed error correction capability of codes on graphs. In Information Theory and Applications Workshop, ITA 2009 (pp. 50-55). [5044922] (Information Theory and Applications Workshop, ITA 2009). https://doi.org/10.1109/ITA.2009.5044922