On the guaranteed error correction capability of LDPC codes
Information Theory
2016-11-17 v1 math.IT
Abstract
We investigate the relation between the girth and the guaranteed error correction capability of -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 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.
Cite
@article{arxiv.0801.1276,
title = {On the guaranteed error correction capability of LDPC codes},
author = {Shashi Kiran Chilappagari and Dung Viet Nguyen and Bane Vasic and Michael Marcellin},
journal= {arXiv preprint arXiv:0801.1276},
year = {2016}
}
Comments
5 pages, submitted to IEEE International Symposium on Information Theory (ISIT), 2008