Fountain Communication using Concatenated Codes
Information Theory
2011-06-13 v4 math.IT
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.
Cite
@article{arxiv.0907.2984,
title = {Fountain Communication using Concatenated Codes},
author = {Zheng Wang and Jie Luo},
journal= {arXiv preprint arXiv:0907.2984},
year = {2011}
}