In this contribution, we consider design of distributed LT codes, i.e., independent rateless encodings of multiple sources which communicate to a common relay, where relay is able to combine incoming packets from the sources and forwards them to receivers. We provide density evolution formulae for distributed LT codes, which allow us to formulate distributed LT code design problem and prove the equivalence of performance of distributed LT codes and LT codes with related parameters in the asymptotic regime. Furthermore, we demonstrate that allowing LT coding apparatus at both the sources and the relay may prove advantageous to coding only at the sources and coding only at the relay.
|Translated title of the contribution||AND-OR tree analysis of distributed LT codes|
|Title of host publication||IEEE Information Theory Workshop on Networking and Information Theory, 2009 (ITW 2009), Volos, Greece|
|Publisher||Institute of Electrical and Electronics Engineers (IEEE)|
|Pages||261 - 265|
|Number of pages||5|
|Publication status||Published - Sep 2009|
|Event||IEEE Information Theory Workshop on Networking and Information Theory - Volos, Greece|
Duration: 1 Sep 2009 → …
|Conference||IEEE Information Theory Workshop on Networking and Information Theory|
|Period||1/09/09 → …|
Bibliographical noteRose publication type: Conference contribution
Additional information: With accompanying conference presentation
Sponsorship: D. Sejdinovic and R. Piechocki would like to thank Toshiba Telecommunications Research Laboratory and its directors for supporting this work.
This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bristol's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to firstname.lastname@example.org.
By choosing to view this document, you agree to all provisions of the copyright laws protecting it.