Distributed LT codes

Srinath Puducheri; Jörg Kliewer; Thomas B. Fuja

doi:10.1109/ISIT.2006.261875

Distributed LT codes

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

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

36 Scopus citations

Abstract

This paper proposes a novel distributed encoding procedure to realize codes that resemble LT codes (rateless codes for erasure correction) in both structure and performance. For the case of two sources communicating with a single sink via a common relay, this technique separately encodes k/2 symbols of information onto slightly more than k code symbols at each source. These two codewords are then selectively XOR-ed at the relay, such that the result can be decoded by the sink to recover all k information symbols. It is shown that, for the case of four sources communicating to a single sink, the use of a similar distributed LT code leads to a 50% reduction in overhead at the sink, compared to the use of four individual LT codes.

Original language	English (US)
Title of host publication	Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
Pages	987-991
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2006.261875
State	Published - 2006
Externally published	Yes
Event	2006 IEEE International Symposium on Information Theory, ISIT 2006 - Seattle, WA, United States Duration: Jul 9 2006 → Jul 14 2006

Publication series

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

Other

Other	2006 IEEE International Symposium on Information Theory, ISIT 2006
Country/Territory	United States
City	Seattle, WA
Period	7/9/06 → 7/14/06

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2006.261875

Cite this

@inproceedings{2c07b8231bbf4a2b95d18489997eebe2,

title = "Distributed LT codes",

abstract = "This paper proposes a novel distributed encoding procedure to realize codes that resemble LT codes (rateless codes for erasure correction) in both structure and performance. For the case of two sources communicating with a single sink via a common relay, this technique separately encodes k/2 symbols of information onto slightly more than k code symbols at each source. These two codewords are then selectively XOR-ed at the relay, such that the result can be decoded by the sink to recover all k information symbols. It is shown that, for the case of four sources communicating to a single sink, the use of a similar distributed LT code leads to a 50% reduction in overhead at the sink, compared to the use of four individual LT codes.",

author = "Srinath Puducheri and J{\"o}rg Kliewer and Fuja, {Thomas B.}",

year = "2006",

doi = "10.1109/ISIT.2006.261875",

language = "English (US)",

isbn = "1424405041",

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

pages = "987--991",

booktitle = "Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006",

note = "2006 IEEE International Symposium on Information Theory, ISIT 2006 ; Conference date: 09-07-2006 Through 14-07-2006",

}

Puducheri, S, Kliewer, J & Fuja, TB 2006, Distributed LT codes. in Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006., 4036112, IEEE International Symposium on Information Theory - Proceedings, pp. 987-991, 2006 IEEE International Symposium on Information Theory, ISIT 2006, Seattle, WA, United States, 7/9/06. https://doi.org/10.1109/ISIT.2006.261875

TY - GEN

T1 - Distributed LT codes

AU - Puducheri, Srinath

AU - Kliewer, Jörg

AU - Fuja, Thomas B.

PY - 2006

Y1 - 2006

N2 - This paper proposes a novel distributed encoding procedure to realize codes that resemble LT codes (rateless codes for erasure correction) in both structure and performance. For the case of two sources communicating with a single sink via a common relay, this technique separately encodes k/2 symbols of information onto slightly more than k code symbols at each source. These two codewords are then selectively XOR-ed at the relay, such that the result can be decoded by the sink to recover all k information symbols. It is shown that, for the case of four sources communicating to a single sink, the use of a similar distributed LT code leads to a 50% reduction in overhead at the sink, compared to the use of four individual LT codes.

AB - This paper proposes a novel distributed encoding procedure to realize codes that resemble LT codes (rateless codes for erasure correction) in both structure and performance. For the case of two sources communicating with a single sink via a common relay, this technique separately encodes k/2 symbols of information onto slightly more than k code symbols at each source. These two codewords are then selectively XOR-ed at the relay, such that the result can be decoded by the sink to recover all k information symbols. It is shown that, for the case of four sources communicating to a single sink, the use of a similar distributed LT code leads to a 50% reduction in overhead at the sink, compared to the use of four individual LT codes.

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

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

U2 - 10.1109/ISIT.2006.261875

DO - 10.1109/ISIT.2006.261875

M3 - Conference contribution

AN - SCOPUS:35148872897

SN - 1424405041

SN - 9781424405046

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 987

EP - 991

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

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

Y2 - 9 July 2006 through 14 July 2006

ER -

Distributed LT codes

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this