Fountain Communication using Concatenated Codes
classification
💻 cs.IT
math.IT
keywords
fountainconcatenatedcommunicationcodescodingschemesachievablechannel
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.