Fountain capacity

Shlomo Shamai; Emre Telatar; Sergio Verdú

doi:10.1109/ISIT.2006.261807

Fountain capacity

Shlomo Shamai, Emre Telatar, Sergio Verdú

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

6 Scopus citations

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.

Original language	English (US)
Title of host publication	Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
Pages	1881-1884
Number of pages	4
DOIs	https://doi.org/10.1109/ISIT.2006.261807
State	Published - 2006
Event	2006 IEEE International Symposium on Information Theory, ISIT 2006 - Seattle, WA, United States Duration: Jul 9 2006 → Jul 14 2006

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8101

Other

Other	2006 IEEE International Symposium on Information Theory, ISIT 2006
Country/Territory	United States
City	Seattle, WA
Period	7/9/06 → 7/14/06

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2006.261807

Cite this

@inproceedings{35479654c7274e5c9317ce2e9274426e,

title = "Fountain capacity",

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.",

author = "Shlomo Shamai and Emre Telatar and Sergio Verd{\'u}",

year = "2006",

doi = "10.1109/ISIT.2006.261807",

language = "English (US)",

isbn = "1424405041",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "1881--1884",

booktitle = "Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006",

note = "2006 IEEE International Symposium on Information Theory, ISIT 2006 ; Conference date: 09-07-2006 Through 14-07-2006",

}

Shamai, S, Telatar, E & Verdú, S 2006, Fountain capacity. in Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006., 4036294, IEEE International Symposium on Information Theory - Proceedings, pp. 1881-1884, 2006 IEEE International Symposium on Information Theory, ISIT 2006, Seattle, WA, United States, 7/9/06. https://doi.org/10.1109/ISIT.2006.261807

TY - GEN

T1 - Fountain capacity

AU - Shamai, Shlomo

AU - Telatar, Emre

AU - Verdú, Sergio

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=39049161093&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=39049161093&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2006.261807

DO - 10.1109/ISIT.2006.261807

M3 - Conference contribution

AN - SCOPUS:39049161093

SN - 1424405041

SN - 9781424405046

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1881

EP - 1884

BT - Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006

T2 - 2006 IEEE International Symposium on Information Theory, ISIT 2006

Y2 - 9 July 2006 through 14 July 2006

ER -

Fountain capacity

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this