AND-OR Tree Analysis of Distributed LT Codes.
ITW: 2009 IEEE INFORMATION THEORY WORKSHOP ON NETWORKING AND INFORMATION THEORY.
(pp. 261 - 265).
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.
|Title:||AND-OR Tree Analysis of Distributed LT Codes|
|Event:||IEEE Information Theory Workshop on Networking and Information Theory|
|Dates:||2009-06-10 - 2009-06-12|
|UCL classification:||UCL > School of Life and Medical Sciences
UCL > School of Life and Medical Sciences > Faculty of Life Sciences
UCL > School of Life and Medical Sciences > Faculty of Life Sciences > Gatsby Computational Neuroscience Unit
Archive Staff Only