Analysis of bipartite graph codes on the binary erasure channel

Arya Mazumdar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

We derive density evolution equations for codes on bipartite graphs (BG codes) for the binary erasure channel (BEC). We study the cases of local codes being Introduced on only one side of the graph (Generalized LDPC codes) as well as on both sides. Each local code Is assumed to correct up to a number of erasures one less than Its distancE. We define and enumerate stopping sets for BG codes, which serves an Important tool for analysis of decoding thresholds on the BEC.

Original languageEnglish (US)
Title of host publication45th Annual Allerton Conference on Communication, Control, and Computing 2007
PublisherUniversity of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering
Pages897-904
Number of pages8
ISBN (Electronic)9781605600864
StatePublished - Jan 1 2007
Event45th Annual Allerton Conference on Communication, Control, and Computing 2007 - Monticello, United States
Duration: Sep 26 2007Sep 28 2007

Publication series

Name45th Annual Allerton Conference on Communication, Control, and Computing 2007
Volume2

Other

Other45th Annual Allerton Conference on Communication, Control, and Computing 2007
CountryUnited States
CityMonticello
Period9/26/079/28/07

Cite this

Mazumdar, A. (2007). Analysis of bipartite graph codes on the binary erasure channel. In 45th Annual Allerton Conference on Communication, Control, and Computing 2007 (pp. 897-904). (45th Annual Allerton Conference on Communication, Control, and Computing 2007; Vol. 2). University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering.