Coding schemes for an erasure relay channel

Srinath Puducheri, Jörg Kliewer, Thomas E. Fuja

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

1 Scopus citations


This paper considers a simple network consisting of a source, a destination, and a relay. In this model, the source-relay and relay-destination links are lossless, while the source-destination link is subject to erasures. Four coding schemes for reliably conveying k symbols from the source to the destination are described. Three of these techniques are adapted directly from well-known point-to-point coding schemes - viz., the use of maximum-distance separable (MDS) codes and Luby Transform (LT) codes. The fourth approach is a new technique using uncoded transmission from the source in conjunction with a relay that transmits a sequence with this property: When the destination subtracts the effects of the unerased symbols from the sequence, what remains is an "LT-like" code for the erased symbols - and this property holds regardless of which symbols were erased on the source-destination link. The four approaches are compared in terms of their complexity and performance.

Original languageEnglish (US)
Title of host publicationProceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007
Number of pages5
StatePublished - 2007
Externally publishedYes
Event2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice, France
Duration: Jun 24 2007Jun 29 2007

Publication series

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


Other2007 IEEE International Symposium on Information Theory, ISIT 2007

All Science Journal Classification (ASJC) codes

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


Dive into the research topics of 'Coding schemes for an erasure relay channel'. Together they form a unique fingerprint.

Cite this