DocumentCode
2947338
Title
Fountain Capacity
Author
Shamai, Shlomo ; Telatar, Emre ; Verdu, Sergio
Author_Institution
Technion, Haifa
fYear
2006
fDate
9-14 July 2006
Firstpage
1881
Lastpage
1884
Abstract
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
Keywords
channel capacity; channel coding; Shannon capacity; arbitrary channels; erasure channels; fountain capacity; fountain codes; stationary memoryless channels; Automatic voltage control; Channel capacity; Code standards; Decoding; Equations; Histograms; Memoryless systems; Parity check codes; Uncertainty; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2006 IEEE International Symposium on
Conference_Location
Seattle, WA
Print_ISBN
1-4244-0505-X
Electronic_ISBN
1-4244-0504-1
Type
conf
DOI
10.1109/ISIT.2006.261807
Filename
4036294
Link To Document