Annotated Raptor Codes
Kaveh Mahdaviani, Masoud Ardakani, Chintha Tellambura

TL;DR
This paper introduces an improved version of raptor codes that maintains their low complexity while enhancing performance, notably reducing the overhead needed for reliable data transmission.
Contribution
The paper presents an extension of raptor codes that improves reception rate without increasing encoding or decoding complexity.
Findings
10% reduction in overhead at benchmark block length
Maintains linear complexity of encoding and decoding
Enhanced performance in data reception rate
Abstract
In this paper, an extension of raptor codes is introduced which keeps all the desirable properties of raptor codes, including the linear complexity of encoding and decoding per information bit, unchanged. The new design, however, improves the performance in terms of the reception rate. Our simulations show a 10% reduction in the needed overhead at the benchmark block length of 64,520 bits and with the same complexity per information bit.
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.
