English
Related papers

Related papers: The Channel Capacity Increases with Power

200 papers

This paper introduces a quantitative generalization of the ``more capable'' comparison of broadcast channels, which is termed ``more capable with advantage''. Some basic properties are demonstrated (including tensorization on product…

Information Theory · Computer Science 2024-01-26 Donald Kougang-Yombi , Jan Hązła

The classical capacity of phase-invariant Gaussian channels has been recently determined under the assumption that such channels are memoryless. In this work we generalize this result by deriving the classical capacity of a model of quantum…

Quantum Physics · Physics 2014-10-17 Giacomo De Palma , Andrea Mari , Vittorio Giovannetti

The capability of a given channel to communicate information is, a priori, distinct from its capability to distribute shared randomness. In this article we define randomness distribution capacities of quantum channels assisted by forward,…

Quantum Physics · Physics 2018-05-22 Raul Garcia-Patron , William Matthews , Andreas Winter

The capacity of noncoherent fading relay channels is studied where all terminals are aware of the fading statistics but not of their realizations. It is shown that if the fading coefficient of the channel between the transmitter and the…

Information Theory · Computer Science 2012-12-06 Tobias Koch , Gerhard Kramer

The total memory capacity (MC) of linear recurrent neural networks (RNNs) has been proven to be equal to the rank of the corresponding Kalman controllability matrix, and it is almost surely maximal for connectivity and input weight matrices…

Machine Learning · Computer Science 2025-09-03 Giovanni Ballarin , Lyudmila Grigoryeva , Juan-Pablo Ortega

We consider the problem of universally communicating over an unknown and arbitrarily varying channel, using feedback. The focus of this paper is on determining the input behavior, and specifically, a prior distribution which is used to…

Information Theory · Computer Science 2012-02-03 Yuval Lomnitz , Meir Feder

We consider the communication scenario where multiple cognitive users wish to communicate to the same receiver, in the presence of primary transmission. The cognitive transmitters are assumed to have the side information about the primary…

Information Theory · Computer Science 2007-07-13 Peng Cheng , Guanding Yu , Zhaoyang Zhang , Hsiao-Hwa Chen , Peiliang Qiu

We derive an upper bound on the capacity of non-binary deletion channels. Although binary deletion channels have received significant attention over the years, and many upper and lower bounds on their capacity have been derived, such…

Information Theory · Computer Science 2013-10-10 Mojtaba Rahmati , Tolga M. Duman

We give analytic upper bounds to the channel capacity C for transmission of classical information in electromagnetic channels (bosonic channels with thermal noise). In the practically relevant regimes of high noise and low transmissivity,…

Quantum Physics · Physics 2015-06-11 Vittorio Giovannetti , Seth Lloyd , Lorenzo Maccone , Jeffrey H. Shapiro

We present an upper bound for the quantum channel capacity that is both additive and convex. Our bound can be interpreted as the capacity of a channel for high-fidelity quantum communication when assisted by a family of channels that have…

Quantum Physics · Physics 2008-08-28 Graeme Smith , John A. Smolin , Andreas Winter

We study the high-SNR capacity of MIMO Rayleigh block-fading channels in the noncoherent setting where neither transmitter nor receiver has a priori channel state information. We show that when the number of receive antennas is sufficiently…

Information Theory · Computer Science 2016-11-17 Günther Koliander , Erwin Riegler , Giuseppe Durisi , Franz Hlawatsch

We consider a peak-power-limited single-antenna block-stationary Gaussian fading channel where neither the transmitter nor the receiver knows the channel state information, but both know the channel statistics. This model subsumes most…

Information Theory · Computer Science 2016-11-17 Jun Chen , Venugopal V. Veeravalli

We analyze the role of nonlinear Hamiltonians in bosonic channels. We show that the information capacity as a function of the channel energy is increased with respect to the corresponding linear case, although only when the energy used for…

Quantum Physics · Physics 2009-11-10 Vittorio Giovannetti , Seth Lloyd , Lorenzo Maccone

We determine the capacity of compound classical-quantum channels. As a consequence we obtain the capacity formula for the averaged classical-quantum channels. The capacity result for compound channels demonstrates, as in the classical…

Quantum Physics · Physics 2009-02-16 Igor Bjelakovic , Holger Boche

We present a general model for quantum channels with memory, and show that it is sufficiently general to encompass all causal automata: any quantum process in which outputs up to some time t do not depend on inputs at times t' > t can be…

Quantum Physics · Physics 2009-11-11 Dennis Kretschmann , Reinhard F. Werner

We investigate whether the use of a noiseless, classical feedback channel will increase the capacity of a quantum discrete memoryless channel to transmit classical information. This problem has been previously analyzed by Bowen and…

Quantum Physics · Physics 2007-05-23 Andrew Skeen

The compound broadcast channel with confidential messages (BCC) generalizes the BCC by modeling the uncertainty of the channel. For the compound BCC, it is only known that the actual channel realization belongs to a pre-specified…

Information Theory · Computer Science 2014-11-05 Andrea Grigorescu , Holger Boche , Rafael F. Schaefer , H. Vincent Poor

The capacity of the point-to-point vector Gaussian channel under the peak power constraint is not known in general. This paper considers a simpler scenario in which the input signal vector is forced to have a constant envelope (or norm).…

Information Theory · Computer Science 2016-05-13 Borzoo Rassouli , Bruno Clerckx

The operational capacity of Gaussian MIMO channels with memory was obtained by Brandenburg and Wyner in [9] under certain mild assumptions on the channel impulse response and its noise covariance matrix, which essentuially require channel…

Information Theory · Computer Science 2022-05-11 Sergey Loyka , Charalambos D. Charalambous

This paper develops the fundamental capacity limits of a sampled analog channel under a sub-Nyquist sampling rate constraint. In particular, we derive the capacity of sampled analog channels over a general class of time-preserving sampling…

Information Theory · Computer Science 2016-11-15 Yuxin Chen , Yonina C. Eldar , Andrea J. Goldsmith
‹ Prev 1 8 9 10 Next ›