We consider three capacity definitions for composite channels with channel side information at the receiver. A composite channel consists of a collection of different channels with a distribution characterizing the probability that each channel is in operation. The Shannon capacity of a channel is the highest rate asymptotically achievable with arbitrarily small error probability. Under this definition, the transmission strategy used to achieve the capacity must achieve arbitrarily small error probability for all channels in the collection comprising the composite channel. The resulting capacity is dominated by the worst channel in its collection, no matter how unlikely that channel is. We, therefore, broaden the definition of ca...
abstract: Asymptotic comparisons of ergodic channel capacity at high and low signal-to-noise ratios ...
We obtain the Shannon capacity of a fading channel with channel side information at the transmitter ...
Capacity formulas and random-coding exponents are derived for a generalized family of Gel’fand-Pinsk...
We consider three capacity definitions for general channels with channel side information at the rec...
Abstract-We consider three capacity definitions for general channels with channel side information a...
We consider three capacity definitions for a channel with channel side information at the receiver. ...
We consider transmission of stationary ergodic sources over non-ergodic composite channels with chan...
Abstract-A formula for the capacity of arbitrary single-user channels without feedback (not necessar...
This paper shows the strong converse and the dispersion of memoryless channels with cost constraints...
A general capacity formula C = sup X I(X; Y), which is correct for arbitrary single-user channels wi...
In this article, we revisit the classical problem of channel coding and obtain novel results on prop...
A new definition for the capacity C of a (discrete or semicontinuous) channel with finite memory is ...
In the previous chapters we have examined several methods to transmit digital signals through a chan...
Abstract—A general formula for the capacity of arbitrary compound channels, which are not necessaril...
Fountain codes are currently employed for reliable and efficient transmission of information via era...
abstract: Asymptotic comparisons of ergodic channel capacity at high and low signal-to-noise ratios ...
We obtain the Shannon capacity of a fading channel with channel side information at the transmitter ...
Capacity formulas and random-coding exponents are derived for a generalized family of Gel’fand-Pinsk...
We consider three capacity definitions for general channels with channel side information at the rec...
Abstract-We consider three capacity definitions for general channels with channel side information a...
We consider three capacity definitions for a channel with channel side information at the receiver. ...
We consider transmission of stationary ergodic sources over non-ergodic composite channels with chan...
Abstract-A formula for the capacity of arbitrary single-user channels without feedback (not necessar...
This paper shows the strong converse and the dispersion of memoryless channels with cost constraints...
A general capacity formula C = sup X I(X; Y), which is correct for arbitrary single-user channels wi...
In this article, we revisit the classical problem of channel coding and obtain novel results on prop...
A new definition for the capacity C of a (discrete or semicontinuous) channel with finite memory is ...
In the previous chapters we have examined several methods to transmit digital signals through a chan...
Abstract—A general formula for the capacity of arbitrary compound channels, which are not necessaril...
Fountain codes are currently employed for reliable and efficient transmission of information via era...
abstract: Asymptotic comparisons of ergodic channel capacity at high and low signal-to-noise ratios ...
We obtain the Shannon capacity of a fading channel with channel side information at the transmitter ...
Capacity formulas and random-coding exponents are derived for a generalized family of Gel’fand-Pinsk...