• DocumentCode
    960434
  • Title

    Fountain Capacity

  • Author

    Shamai, Shlomo ; Telatar, I.E. ; Verdu, S.

  • Author_Institution
    Technion-Israel Inst. of Technol., Haifa
  • Volume
    53
  • Issue
    11
  • fYear
    2007
  • Firstpage
    4372
  • Lastpage
    4376
  • Abstract
    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 of the erasure pattern. We show that fountain capacity and Shannon capacity are equal for stationary memoryless channels. In contrast, Shannon capacity may exceed fountain capacity if the channel has memory or is not stationary.
  • Keywords
    channel capacity; codes; information theory; Shannon capacity; arbitrary channel; erasure channel; erasure pattern; erasure rate; fountain capacity; fountain codes; fountain setup; information transmission; reliable reception; stationary memoryless channel; Channel capacity; Cities and towns; Decoding; Equations; Information theory; Memoryless systems; Parity check codes; Robustness; Uncertainty; Vectors; Arbitrarily varying channels; channel capacity; content distribution; erasure channels; fountain codes;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2007.907495
  • Filename
    4373431