
TL;DR
This paper introduces a zigzag decodable fountain code that reduces decoding complexity and erasure rate compared to Raptor codes, using shift and XOR operations for efficient decoding.
Contribution
It presents a novel fountain coding system based on zigzag decodable codes, with analysis showing improved overhead and decoding erasure rate over Raptor codes.
Findings
Outperforms Raptor codes in overhead and erasure rate
Reduces decoding complexity
Efficient decoding via zigzag decoder
Abstract
This paper proposes a fountain coding system which has lower space decoding complexity and lower decoding erasure rate than the Raptor coding systems. The main idea of the proposed fountain code is employing shift and exclusive OR to generate the output packets. This technique is known as the zigzag decodable code, which is efficiently decoded by the zigzag decoder. In other words, we propose a fountain code based on the zigzag decodable code in this paper. Moreover, we analyze the overhead for the received packets, decoding erasure rate, decoding complexity, and asymptotic overhead of the proposed fountain code. As the result, we show that the proposed fountain code outperforms the Raptor codes in terms of the overhead and decoding erasure rate. Simulation results show that the proposed fountain coding system outperforms Raptor coding system in terms of the overhead and the space…
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.
