Fountain Communication using Concatenated Codes
Wang, Zheng · Luo, Jie
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.