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
The main goal for the communication engineer is to design the encoder and decoder so that the system...
In this article, we revisit the classical problem of channel coding and obtain novel results on prop...
We introduced the concept of a digital fountain as a scalable approach to reliable multicast, realiz...
We consider three capacity definitions for general channels with channel side information at the rec...
We consider three capacity definitions for a channel with channel side information at the receiver. ...
Abstract-We consider three capacity definitions for general channels with channel side information a...
Abstract—In this paper, we propose a novel rateless mul-tiple access scheme based on the recently pr...
Abstract-A formula for the capacity of arbitrary single-user channels without feedback (not necessar...
The fountain coding principle provides a framework for efficient and reliable data transmission tech...
In this paper we present a rapid review of known results in the context of different scenario of the...
This paper analyzes the behavior of the reliability of the transmission of information between a tra...
We consider three capacity definitions for composite channels with channel side information at the ...
A general capacity formula C = sup X I(X; Y), which is correct for arbitrary single-user channels wi...
A capacity-achieving sequence of degree distributions for the erasure channel is, roughly speaking, ...
In Section I an inequality of McMillan (1956) implied by unique decipherability is generalized to ch...
The main goal for the communication engineer is to design the encoder and decoder so that the system...
In this article, we revisit the classical problem of channel coding and obtain novel results on prop...
We introduced the concept of a digital fountain as a scalable approach to reliable multicast, realiz...
We consider three capacity definitions for general channels with channel side information at the rec...
We consider three capacity definitions for a channel with channel side information at the receiver. ...
Abstract-We consider three capacity definitions for general channels with channel side information a...
Abstract—In this paper, we propose a novel rateless mul-tiple access scheme based on the recently pr...
Abstract-A formula for the capacity of arbitrary single-user channels without feedback (not necessar...
The fountain coding principle provides a framework for efficient and reliable data transmission tech...
In this paper we present a rapid review of known results in the context of different scenario of the...
This paper analyzes the behavior of the reliability of the transmission of information between a tra...
We consider three capacity definitions for composite channels with channel side information at the ...
A general capacity formula C = sup X I(X; Y), which is correct for arbitrary single-user channels wi...
A capacity-achieving sequence of degree distributions for the erasure channel is, roughly speaking, ...
In Section I an inequality of McMillan (1956) implied by unique decipherability is generalized to ch...
The main goal for the communication engineer is to design the encoder and decoder so that the system...
In this article, we revisit the classical problem of channel coding and obtain novel results on prop...
We introduced the concept of a digital fountain as a scalable approach to reliable multicast, realiz...