Fountain Communication using Concatenated Codes

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. Several important properties of the concatenated coding schemes in multi-user fountain communication scenarios are demonstrated.