On guaranteed error correction capability of GLDPC codes

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

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

Abstract

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)
Title of host publicationProceedings of the International Telemetering Conference
Volume44
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

Other

Other44th Annual International Telemetering Conference and Technical Exhibition - Telemetry: Measure, Move, Record, Analyze...We Do It All, ITC/USA, 2008
CountryUnited States
CitySan Diego, CA
Period10/27/0810/30/08

Fingerprint

Error correction
trapping
expansion

ASJC Scopus subject areas

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

Cite this

Chilappagari, S. K., Nguyen, D. V., Vasic, B. V., & Marcellin, M. W. (2008). On guaranteed error correction capability of GLDPC codes. In Proceedings of the International Telemetering Conference (Vol. 44)

On guaranteed error correction capability of GLDPC codes. / Chilappagari, Shashi Kiran; Nguyen, Dung Viet; Vasic, Bane V; Marcellin, Michael W.

Proceedings of the International Telemetering Conference. Vol. 44 2008.

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

Chilappagari, SK, Nguyen, DV, Vasic, BV & Marcellin, MW 2008, On guaranteed error correction capability of GLDPC codes. in Proceedings of the International Telemetering Conference. vol. 44, 44th Annual International Telemetering Conference and Technical Exhibition - Telemetry: Measure, Move, Record, Analyze...We Do It All, ITC/USA, 2008, San Diego, CA, United States, 10/27/08.
Chilappagari SK, Nguyen DV, Vasic BV, Marcellin MW. On guaranteed error correction capability of GLDPC codes. In Proceedings of the International Telemetering Conference. Vol. 44. 2008
Chilappagari, Shashi Kiran ; Nguyen, Dung Viet ; Vasic, Bane V ; Marcellin, Michael W. / On guaranteed error correction capability of GLDPC codes. Proceedings of the International Telemetering Conference. Vol. 44 2008.
@inproceedings{6c96c9ddaf3d4c5e8ed0817edb339617,
title = "On guaranteed error correction capability of GLDPC codes",
abstract = "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.",
author = "Chilappagari, {Shashi Kiran} and Nguyen, {Dung Viet} and Vasic, {Bane V} and Marcellin, {Michael W}",
year = "2008",
language = "English (US)",
volume = "44",
booktitle = "Proceedings of the International Telemetering Conference",

}

TY - GEN

T1 - On guaranteed error correction capability of GLDPC codes

AU - Chilappagari, Shashi Kiran

AU - Nguyen, Dung Viet

AU - Vasic, Bane V

AU - Marcellin, Michael W

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84877906906&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84877906906&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84877906906

VL - 44

BT - Proceedings of the International Telemetering Conference

ER -