Buffer-Based Distributed LT Codes
Iqbal Hussain, Ming Xiao, and Lars K. Rasmussen

TL;DR
This paper introduces buffer-based distributed LT codes that enable higher relay degrees and flexible source block sizes, improving erasure performance in multi-source relay networks through an analytical optimization framework.
Contribution
It proposes a novel buffer-based approach allowing higher relay degrees and diverse source block sizes, enhancing erasure performance and flexibility in distributed LT codes.
Findings
No loss in erasure performance over lossy links
Improved relay-degree distribution optimization
Enhanced flexibility with different source block sizes
Abstract
We focus on the design of distributed Luby transform (DLT) codes for erasure networks with multiple sources and multiple relays, communicating to a single destination. The erasure-floor performance of DLT codes improves with the maximum degree of the relay-degree distribution. However, for conventional DLT codes, the maximum degree is upper-bounded by the number of sources. An additional constraint is that the sources are required to have the same information block length. We introduce a -bit buffer for each source-relay link, which allows the relay to select multiple encoded bits from the same source for the relay-encoding process; thus, the number of sources no longer limits the maximum degree at the relay. Furthermore, the introduction of buffers facilitates the use of different information block sizes across sources. Based on density evolution we develop an asymptotic analytical…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
