Article thumbnail
Location of Repository

1 Fountain Communication using Concatenated Codes

By Zheng Wang and Jie Luo

Abstract

Abstract — This paper extends linear-complexity concatenated coding schemes to fountain communication over the discretetime 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. Index Terms — coding complexity, concatenated codes, error exponent, fountain communication I

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.323.9599
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.engr.colostate.edu/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.