On the number of errors correctable with codes on graphs

Authors:
Alexander Barg;Arya Mazumdar
Affiliations:
Dept. of ECE and Inst. for Systems Research, University of Maryland, College Park, MD and IPPI RAS, Moscow, Russia;Department of ECE, University of Maryland, College Park, MD
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Year:
2009

Citing 4
Cited 0

On codes from hypergraph

European Journal of Combinatorics
Expander codes

IEEE Transactions on Information Theory - Part 1
On expander codes

IEEE Transactions on Information Theory
On the Error Correction of Regular LDPC Codes Using the Flipping Algorithm

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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.