On the number of errors correctable with codes on graphs

Alexander Barg; Arya Mazumdar

doi:10.1109/ISIT.2009.5206079

On the number of errors correctable with codes on graphs

Alexander Barg, Arya Mazumdar

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.

Original language	English (US)
Title of host publication	2009 IEEE International Symposium on Information Theory, ISIT 2009
Pages	2482-2486
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2009.5206079
State	Published - 2009
Externally published	Yes
Event	2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of Duration: Jun 28 2009 → Jul 3 2009

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8102

Other

Other	2009 IEEE International Symposium on Information Theory, ISIT 2009
Country/Territory	Korea, Republic of
City	Seoul
Period	6/28/09 → 7/3/09

Access

10.1109/ISIT.2009.5206079

OpenUrl availability

Full text

Cite this

Barg, A & Mazumdar, A 2009, On the number of errors correctable with codes on graphs. in 2009 IEEE International Symposium on Information Theory, ISIT 2009., 5206079, IEEE International Symposium on Information Theory - Proceedings, pp. 2482-2486, 2009 IEEE International Symposium on Information Theory, ISIT 2009, Seoul, Korea, Republic of, 6/28/09. https://doi.org/10.1109/ISIT.2009.5206079

@inproceedings{775917c868a245df8c14704ab6248a5d,

title = "On the number of errors correctable with codes on graphs",

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.",

author = "Alexander Barg and Arya Mazumdar",

year = "2009",

doi = "10.1109/ISIT.2009.5206079",

language = "English (US)",

isbn = "9781424443130",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "2482--2486",

booktitle = "2009 IEEE International Symposium on Information Theory, ISIT 2009",

note = "2009 IEEE International Symposium on Information Theory, ISIT 2009 ; Conference date: 28-06-2009 Through 03-07-2009",

}

TY - GEN

T1 - On the number of errors correctable with codes on graphs

AU - Barg, Alexander

AU - Mazumdar, Arya

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=70449516038&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70449516038&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2009.5206079

DO - 10.1109/ISIT.2009.5206079

M3 - Conference contribution

AN - SCOPUS:70449516038

SN - 9781424443130

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2482

EP - 2486

BT - 2009 IEEE International Symposium on Information Theory, ISIT 2009

T2 - 2009 IEEE International Symposium on Information Theory, ISIT 2009

Y2 - 28 June 2009 through 3 July 2009

ER -

On the number of errors correctable with codes on graphs

Abstract

Publication series

Other

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this