Concatenated fountain codes

Authors:
Zheng Wang;Jie Luo
Affiliations:
Electrical & Computer Engineering Department, Colorado State University, Fort Collins, CO;Electrical & Computer Engineering Department, Colorado State University, Fort Collins, CO
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Year:
2009

Citing 7
Cited 0

A digital fountain approach to reliable distribution of bulk data

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
LT Codes

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Raptor codes

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Approaching Blokh-Zyablov error exponent with linear-time encodable/decodable codes

IEEE Communications Letters
Random codes: minimum distances and error exponents

IEEE Transactions on Information Theory
Linear-time encodable/decodable codes with near-optimal rate

IEEE Transactions on Information Theory
Fountain Capacity

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates fountain communication over discrete-time memoryless channels. Fountain error exponent achievable by linear complexity concatenated fountain codes is derived.