LDPC coding for the three-terminal erasure relay channel

Deepak Sridhara, Christine A. Kelley

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

4 Scopus citations

Abstract

A three terminal erasure relay channel is considered. It has been shown that appropriately designed maximum distance separable codes achieve the cut-set upper bound on capacity of the three terminal erasure relay channel. This paper presents low-density parity-check (LDPC) coding alternatives for this channel. Design rules for constructing LDPC codes that perform close to the cut-set upper bound on capacity are provided for the general erasure relay channel and also the degraded erasure relay channel, wherein all the information available at the receiver are also available at the relay.

Original languageEnglish (US)
Title of host publicationProceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
Pages1229-1233
Number of pages5
DOIs
StatePublished - Dec 1 2006
Event2006 IEEE International Symposium on Information Theory, ISIT 2006 - Seattle, WA, United States
Duration: Jul 9 2006Jul 14 2006

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101

Other

Other2006 IEEE International Symposium on Information Theory, ISIT 2006
CountryUnited States
CitySeattle, WA
Period7/9/067/14/06

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'LDPC coding for the three-terminal erasure relay channel'. Together they form a unique fingerprint.

  • Cite this

    Sridhara, D., & Kelley, C. A. (2006). LDPC coding for the three-terminal erasure relay channel. In Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006 (pp. 1229-1233). [4036161] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2006.262001