On the guaranteed error correction capability of LDPC codes
Chilappagari, S.K.
Nguyen, D.V.
Vasic, B.
Marcellin, M.W.
Dept. of Electr. & Comput. Eng., Univ. of Arizona, Tucson, AZ;
This paper appears in: Information Theory, 2008. ISIT 2008. IEEE International Symposium on
Publication Date: 6-11 July 2008
On page(s): 434-438
Location: Toronto, ON,
ISBN: 978-1-4244-2256-2
INSPEC Accession Number: 10156349
Digital Object Identifier: 10.1109/ISIT.2008.4595023
Current Version Published: 2008-08-08
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
