Guaranteed error correction capability of codes on graphs
S. K. Chilappagari, B. Vasić, and M.W. Marcellin, "Guaranteed error correction capability of codes on graphs," Proc. Inform. Theory and Applicat. Workshop, Feb. 8 - 13 2009, pp. 50 - 55.
Link
Citation
@INPROCEEDINGS{CVM_09_ITA,
author={Chilappagari, S. K. and Vasić, B. and Marcellin, M.W.},
booktitle = {Proc. Inform. Theory and Applicat. Workshop},
title={Guaranteed error correction capability of codes on graphs},
year={2009},
month={Feb. 8--13},
pages={50--55},
address={San Diego, CA, USA},
abstract={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.},
}