DocumentCode :
2993028
Title :
On the number of errors correctable with codes on graphs
Author :
Barg, Alexander ; Mazumdar, Arya
Author_Institution :
Dept. of ECE, Univ. of Maryland, College Park, MD, USA
fYear :
2009
fDate :
June 28 2009-July 3 2009
Firstpage :
2482
Lastpage :
2486
Abstract :
We estimate the number of errors corrected by two different ensembles of codes on graphs (generalized LDPC codes), namely codes on regular bipartite graphs and their extension to hypergraphs.
Keywords :
error correction codes; graph theory; parity check codes; LDPC code; bipartite graph; error correction code; hypergraph; parity check code; Binary codes; Bipartite graph; Educational institutions; Eigenvalues and eigenfunctions; Error correction; Error correction codes; Iterative decoding; Linear code; Parity check codes; Turning;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location :
Seoul
Print_ISBN :
978-1-4244-4312-3
Electronic_ISBN :
978-1-4244-4313-0
Type :
conf
DOI :
10.1109/ISIT.2009.5206079
Filename :
5206079
Link To Document :
بازگشت