Fountain Capacity

Fountain codes have been successfully employed for reliable and efficient transmission of information via erasure channels with unknown erasure rates. This paper introduces the notion of fountain capacity for arbitrary channels, and shows that it is equal to the conventional Shannon capacity for stationary memoryless channels. In contrast, when the channel is not stationary or has memory, Shannon capacity and fountain capacity need not be equal.


Published in:
IEEE International Symposium on Information Theory, 1881-1884
Presented at:
IEEE International Symposium on Information Theory, Seattle, USA, 9-14 July 2006
Year:
2006
Other identifiers:
DAR: 11462
Laboratories:




 Record created 2007-03-08, last modified 2018-01-27

External link:
Download fulltext
n/a
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)