TY - GEN
T1 - Guaranteed error correction capability of codes on graphs
AU - Chilappagari, Shashi Kiran
AU - Vasic, Bane
AU - Marcellin, Michael W.
PY - 2009
Y1 - 2009
N2 - The guaranteed error correction capability of left regular LDPC codes under different hard decision decision algorithms is investigated. A summary of recent results relating the column weight and girth of the Tanner graph to the guaranteed error correction capability is provided. The intuition behind expander based arguments and their potential to derive new results for column-weight-three codes is provided.
AB - The guaranteed error correction capability of left regular LDPC codes under different hard decision decision algorithms is investigated. A summary of recent results relating the column weight and girth of the Tanner graph to the guaranteed error correction capability is provided. The intuition behind expander based arguments and their potential to derive new results for column-weight-three codes is provided.
UR - http://www.scopus.com/inward/record.url?scp=70349277297&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70349277297&partnerID=8YFLogxK
U2 - 10.1109/ITA.2009.5044922
DO - 10.1109/ITA.2009.5044922
M3 - Conference contribution
AN - SCOPUS:70349277297
SN - 9781424439904
T3 - Information Theory and Applications Workshop, ITA 2009
SP - 50
EP - 55
BT - Information Theory and Applications Workshop, ITA 2009
T2 - Information Theory and Applications Workshop, ITA 2009
Y2 - 8 February 2009 through 13 February 2009
ER -