2000 character limit reached
Fountain Communication using Concatenated Codes
Published 17 Jul 2009 in cs.IT and math.IT | (0907.2984v4)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.