LDPC coding for the three-terminal erasure relay channel

Deepak Sridhara, Christine A. Kelley

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

4 Citations (Scopus)

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

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

LDPC coding for the three-terminal erasure relay channel. / Sridhara, Deepak; Kelley, Christine A.

Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006. 2006. p. 1229-1233 4036161 (IEEE International Symposium on Information Theory - Proceedings).

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

Sridhara, D & Kelley, CA 2006, LDPC coding for the three-terminal erasure relay channel. in Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006., 4036161, IEEE International Symposium on Information Theory - Proceedings, pp. 1229-1233, 2006 IEEE International Symposium on Information Theory, ISIT 2006, Seattle, WA, United States, 7/9/06. https://doi.org/10.1109/ISIT.2006.262001
Sridhara D, Kelley CA. LDPC coding for the three-terminal erasure relay channel. In Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006. 2006. p. 1229-1233. 4036161. (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2006.262001
Sridhara, Deepak ; Kelley, Christine A. / LDPC coding for the three-terminal erasure relay channel. Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006. 2006. pp. 1229-1233 (IEEE International Symposium on Information Theory - Proceedings).
@inproceedings{db104afb121a46dbb9c4c5e3ddfd065a,
title = "LDPC coding for the three-terminal erasure relay channel",
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.",
author = "Deepak Sridhara and Kelley, {Christine A.}",
year = "2006",
month = "12",
day = "1",
doi = "10.1109/ISIT.2006.262001",
language = "English (US)",
isbn = "1424405041",
series = "IEEE International Symposium on Information Theory - Proceedings",
pages = "1229--1233",
booktitle = "Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006",

}

TY - GEN

T1 - LDPC coding for the three-terminal erasure relay channel

AU - Sridhara, Deepak

AU - Kelley, Christine A.

PY - 2006/12/1

Y1 - 2006/12/1

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

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

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

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

U2 - 10.1109/ISIT.2006.262001

DO - 10.1109/ISIT.2006.262001

M3 - Conference contribution

AN - SCOPUS:39049148948

SN - 1424405041

SN - 9781424405046

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1229

EP - 1233

BT - Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006

ER -