Abstract:
This paper investigates fountain communication over discrete-time memoryless channels. Fountain error exponent achievable by linear complexity concatenated fountain codes...Show MoreMetadata
Abstract:
This paper investigates fountain communication over discrete-time memoryless channels. Fountain error exponent achievable by linear complexity concatenated fountain codes is derived.
Published in: 2009 IEEE International Symposium on Information Theory
Date of Conference: 28 June 2009 - 03 July 2009
Date Added to IEEE Xplore: 18 August 2009
ISBN Information: