AND-OR tree analysis of distributed LT codes

• Published in: 2009 IEEE Information Theory Workshop on Networking and Information Theory pp. 261 - 265
• Main Authors: Sejdinovic, D., Piechocki, R.J., Doufexi, A.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.06.2009
• Subjects: Belief propagation; Computational efficiency; Decoding; Design engineering; Encoding; Frame relay; Hamming weight; Information analysis; Probability distribution; Random variables
• ISBN: 1424445353; 9781424445356
• DOI: 10.1109/ITWNIT.2009.5158583

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.