We correct some expressions obtained in the above paper. The corrected expressions will be useful for evaluating the channel capacity of wireless communication systems over fading channels.

The problem of capacity achieving (optimal) input probability measure (p.m.) has been widely investigated for several channel models with constrained inputs. So far, no outstanding generalizations have been derived. This paper does a forward step in this direction, by introducing a set of new requirements, for the class of real scalar conditional output p.m.’s, under which the optimal input p.m...

Optimal actions of an agent facing a Shannon capacity constraint on the translation of an uncertain signal into an action can easily turn out to be discretely distributed, even when the objective function and the initial distribution of uncertainty contain no discrete elements. We show this result analytically in a broad class of cases. It has implications for the interpretation of observed int...

—This paper presents a comparison between the outage capacity of MIMO channels predicted by the Kronecker and Müller models as a function of the number of scatterers, transmit and receive antennas. The Müller model is based on the single-scattered rays between arrays of transmit-and receive antennas, while the Kronecker model considers only double scattering. The channel capacity predictions by...

For a partially degradable (PD) channel, the channel output state can be used to simulate the degraded environment state. The quantum capacity of a PD channel has been proven to be additive. Here, we show that the private classical capacity of arbitrary dimensional PD channels is equal to the quantum capacity of the channel and also single-letterizes. We prove that higher rates of private class...

It is shown that no source encoding is needed in the definition of the capacity of a quantum channel for transmitting entanglement. This capacity bounds the “protected subspace” capacity. We find the capacity of the quantum erasure channel using these results, without relying on an unproven assumption as in an earlier paper. Typeset using REVTEX 1

We introduce a proper framework of coding problems for a quantum memoryless channel and derive an asymptotic formula for the channel capacity, based upon the philosophy that any information theory shall be constructed in terms of observable quantities. Some general lower and upper bounds for the quantum channel capacity are also derived.

We study the one-shot zero-error classical capacity of quantum channels assisted by quantum non-signalling correlations, and the reverse problem of simulation. Both lead to simple semi-definite programmings whose solutions can be given in terms of the conditional min-entropies. We show that the asymptotic simulation cost is precisely the conditional min-entropy of the Choi-Jamiołkowski matrix o...