Error Correction Coding Laboratory

Home Publications Projects Tools Links
  • Contact
    • +1-520-626-5550
    • vasic@ece.arizona.edu

On the guaranteed error correction capability of LDPC codes

S. K. Chilappagari, D. V. Nguyen, B. Vasić, and M. W. Marcellin, "On the guaranteed error correction capability of LDPC codes," Proc. IEEE Int. Symp. on Inform. Theory, Jul. 6 - 11 2008, pp. 434 - 438.

Link

ISIT2008.pdf

Citation

@inproceedings{CNVM_08_ISIT,
abstract = {We investigate the relation between the girth and the guaranteed error correction capability of gamma-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 3gamma/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.},
author = {Chilappagari, S. K. and Nguyen, D. V. and Vasić, B. and Marcellin, M. W.},
booktitle = {Proc. IEEE Int. Symp. on Inform. Theory},
month = {Jul. 6--11},
pages = {434--438},
title = {{O}n the guaranteed error correction capability of {LDPC} codes},
year = {2008},
address = {Toronto, ON, Canada},
}