Fountain Capacity

@article{Shamai2007FountainC,
  title={Fountain Capacity},
  author={S. Shamai and E. Telatar and S. Verd{\'u}},
  journal={IEEE Transactions on Information Theory},
  year={2007},
  volume={53},
  pages={4372-4376}
}
  • S. Shamai, E. Telatar, S. Verdú
  • Published 2007
  • Computer Science
  • 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

    Topics from this paper.

    Concatenated F ountain Codes
    Fountain Communication using Concatenated Codes
    • 3
    • Open Access
    Optimal Age over Erasure Channels
    • 11
    • Open Access
    Variable-Rate Channel Capacity
    • 64
    • Open Access
    Capacity of the Gaussian Erasure Channel
    • 12
    • Open Access
    Rateless Codes for AVC Models
    • 14
    • Open Access
    Error Performance of Channel Coding in Random-Access Communication
    • 19
    • Open Access
    Using Fountain Codes to Control the Peak-to-Average Power Ratio of OFDM Signals
    • 36

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 31 REFERENCES
    A general formula for channel capacity
    • 729
    • Open Access
    The Gaussian Erasure Channel
    • 28
    • Open Access
    Raptor codes on binary memoryless symmetric channels
    • 396
    • Open Access
    The Information Lost in Erasures
    • 68
    • Open Access
    On channel capacity per unit cost
    • 504
    • Open Access
    Raptor codes on symmetric channels
    • 85
    • Open Access
    Elimination of correlation in random codes for arbitrarily varying channels
    • 303
    • Highly Influential
    • Open Access
    Rateless codes on noisy channels
    • 312
    • Open Access