DocumentCode :
1858253
Title :
Guaranteed error correction capability of codes on graphs
Author :
Chilappagari, Shashi Kiran ; Vasic, Bane ; Marcellin, Michael W.
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Arizona, Tucson, AZ
fYear :
2009
fDate :
8-13 Feb. 2009
Firstpage :
50
Lastpage :
55
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.
Keywords :
decision theory; error correction codes; graph theory; parity check codes; LDPC codes; Tanner graph; column-weight-three codes; decision algorithms; guaranteed error correction capability; Cities and towns; Data communication; Error correction codes; Error probability; Fading; Iterative decoding; Parity check codes; Performance analysis; Rayleigh channels; Steady-state;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory and Applications Workshop, 2009
Conference_Location :
San Diego, CA
Print_ISBN :
978-1-4244-3990-4
Type :
conf
DOI :
10.1109/ITA.2009.5044922
Filename :
5044922
Link To Document :
بازگشت