Fountain Capacity

  title={Fountain Capacity},
  author={Shlomo Shamai and Emre Telatar and Sergio Verd{\'u}},
  journal={IEEE Transactions on Information Theory},
Fountain codes are currently employed for reliable and efficient transmission of information via erasure channels with unknown erasure rates. This correspondence introduces the notion of fountain capacity for arbitrary channels. In contrast to the conventional definition of rate, in the fountain setup the definition of rate penalizes the reception of symbols by the receiver rather than their transmission. Fountain capacity measures the maximum rate compatible with reliable reception regardless… CONTINUE READING
Highly Cited
This paper has 27 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
16 Citations
16 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 16 extracted citations


Publications referenced by this paper.
Showing 1-10 of 16 references

Source broadcasting with unknown amount of receiver side information

  • A. M. Tulino, S. Verdú, G. Caire, S. Shamai
  • Proc . 2002 IEEE Information Theory Workshop
  • 2007

Fountain codes for lossless compression of binary sources

  • G. Caire, S. Shamai, A. Shokrollahi, S. Verdú
  • 2004 IEEE Workshop on Information Theory, San…
  • 2004
1 Excerpt

Raptor codes

  • M. G. Luby
  • Foundations of Computer Science , Vancouver , BC…
  • 2002

Static broadcasting

  • N. Shulman
  • Proc . 2000 IEEE Int . Symp . Information Theory…
  • 2000

Similar Papers

Loading similar papers…