Distributed LT Codes
- 1 July 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 987-991
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 codesKeywords
This publication has 8 references indexed in Scilit:
- Polynomial Time Algorithms for Multicast Network Code ConstructionIEEE Transactions on Information Theory, 2005
- An algebraic approach to network codingIEEE/ACM Transactions on Networking, 2003
- LT codes2003
- Linear network codingIEEE Transactions on Information Theory, 2003
- A digital fountain approach to asynchronous reliable multicastIEEE Journal on Selected Areas in Communications, 2002
- Network information flowIEEE Transactions on Information Theory, 2000
- A digital fountain approach to reliable distribution of bulk dataACM SIGCOMM Computer Communication Review, 1998
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962