Abstract—A general formula for the capacity of arbitrary compound channels, which are not necessarily ergodic, stationary or information-stable, is obtained using the information density approach. A direct (constructive) proof is given. To prove achiev-ability, we generalize Feinstein Lemma to the compound channel setting, and to prove converse, we generalize Verdu-Han Lemma to the same compound setting. This extends the general formula for channel capacity in [8] to arbitrary compound channels (not necessarily finite-state or countable). I
A new formulation for the channel capacity problem is derived by using the duality theory of convex ...
Abstract-We consider three capacity definitions for general channels with channel side information a...
Ahlswede R. Certain results in coding theory for compound channels. In: Rényi A, ed. Proceedings of ...
Ahlswede R, Wolfowitz J. The structure of capacity functions for compound channels. In: Behara M, ed...
Abstract-A formula for the capacity of arbitrary single-user channels without feedback (not necessar...
A general capacity formula C = sup X I(X; Y), which is correct for arbitrary single-user channels wi...
Abstract—Code for a compound discrete memoryless channel (DMC) is required to have small probability...
International audienceThis paper investigates the capacity of compound state-dependent channels with...
In this paper we address the issue of universal or robust communication over quantum channels. Speci...
A general formula for the capacity of stationary nonanticipatory channels is known. However, it is d...
In this work, we find the capacity of a compound finite-state channel (FSC) with time-invariant dete...
In this correspondence, we study the behavior of the compound channel under a zero-error constraint....
Abstract—We consider the Gel’fand-Pinsker problem in which the channel and state are general, i.e., ...
Abstract — This work addresses the feedback capacity of compound channels with memory. We provide an...
Abstract—We consider the Gel’fand-Pinsker problem in which the channel and state are general, i.e., ...
A new formulation for the channel capacity problem is derived by using the duality theory of convex ...
Abstract-We consider three capacity definitions for general channels with channel side information a...
Ahlswede R. Certain results in coding theory for compound channels. In: Rényi A, ed. Proceedings of ...
Ahlswede R, Wolfowitz J. The structure of capacity functions for compound channels. In: Behara M, ed...
Abstract-A formula for the capacity of arbitrary single-user channels without feedback (not necessar...
A general capacity formula C = sup X I(X; Y), which is correct for arbitrary single-user channels wi...
Abstract—Code for a compound discrete memoryless channel (DMC) is required to have small probability...
International audienceThis paper investigates the capacity of compound state-dependent channels with...
In this paper we address the issue of universal or robust communication over quantum channels. Speci...
A general formula for the capacity of stationary nonanticipatory channels is known. However, it is d...
In this work, we find the capacity of a compound finite-state channel (FSC) with time-invariant dete...
In this correspondence, we study the behavior of the compound channel under a zero-error constraint....
Abstract—We consider the Gel’fand-Pinsker problem in which the channel and state are general, i.e., ...
Abstract — This work addresses the feedback capacity of compound channels with memory. We provide an...
Abstract—We consider the Gel’fand-Pinsker problem in which the channel and state are general, i.e., ...
A new formulation for the channel capacity problem is derived by using the duality theory of convex ...
Abstract-We consider three capacity definitions for general channels with channel side information a...
Ahlswede R. Certain results in coding theory for compound channels. In: Rényi A, ed. Proceedings of ...