TY - GEN
T1 - On the guaranteed error correction capability of LDPC codes
AU - Chilappagari, Shashi Kiran
AU - Nguyen, Dung Viet
AU - Vasić, Bane
AU - Marcellin, Michael W.
PY - 2008
Y1 - 2008
N2 - 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 3γ/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.
AB - 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 3γ/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.
UR - http://www.scopus.com/inward/record.url?scp=52349111240&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=52349111240&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2008.4595023
DO - 10.1109/ISIT.2008.4595023
M3 - Conference contribution
AN - SCOPUS:52349111240
SN - 9781424422579
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 434
EP - 438
BT - Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
T2 - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Y2 - 6 July 2008 through 11 July 2008
ER -