Fountain Communication using Concatenated Codes
Zheng Wang, Jie Luo
TL;DR
This paper extends concatenated coding schemes to fountain communication over memoryless channels, deriving error exponents and exploring multi-user scenarios to improve reliability and efficiency.
Contribution
It introduces linear-complexity concatenated fountain codes with new error exponent bounds and analyzes their properties in multi-user environments.
Findings
Derived achievable fountain error exponents for concatenated codes
Showed concatenated codes have beneficial properties in multi-user scenarios
Extended linear-complexity schemes to fountain communication
Abstract
This paper extends linear-complexity concatenated coding schemes to fountain communication over the discrete-time memoryless channel. Achievable fountain error exponents for one-level and multi-level concatenated fountain codes are derived. It is also shown that concatenated coding schemes possess interesting properties in several multi-user fountain communication scenarios.
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.
Taxonomy
TopicsError Correcting Code Techniques · Advanced Wireless Communication Techniques · Cooperative Communication and Network Coding