English
Related papers

Related papers: A Counterexample to Cover's 2P Conjecture on Gauss…

200 papers

A novel technique to optimize the input distribution and compute a lower bound for the capacity of the nonlinear optical fiber channel is proposed. The technique improves previous bounds obtained with the additive white Gaussian noise…

Information Theory · Computer Science 2021-06-09 Stella Civelli , Enrico Forestieri , Alexey Lotsmanov , Dmitry Razdoburdin , Marco Secondini

We prove that the reciprocal of Fisher information of a log-concave probability density $X$ in ${\bf{R}}^n$ is concave in $t$ with respect to the addition of a Gaussian noise $Z_t = N(0, tI_n)$. As a byproduct of this result we show that…

Information Theory · Computer Science 2015-06-23 G. Toscani

We determine the loss in capacity incurred by using signal constellations with a bounded support over general complex-valued additive-noise channels for suitably high signal-to-noise ratio. Our expression for the capacity loss recovers the…

Information Theory · Computer Science 2016-11-17 Tobias Koch , Alfonso Martinez , Albert Guillén i Fàbregas

We consider symmetric two-user Gaussian interference channel with common messages. We derive an upper bound on the sum capacity, and show that the upper bound is tight in the low interference regime, where the optimal transmission scheme is…

Information Theory · Computer Science 2014-01-22 Quan Geng , Tie Liu

The optimal rate of reliable communication over a quantum channel can be enhanced by pre-shared entanglement. Whereas the enhancement may be unbounded in infinite-dimensional settings even when the input power is constrained, a…

The feedback capacity of additive stationary Gaussian noise channels is characterized as the solution to a variational problem. Toward this end, it is proved that the optimal feedback coding scheme is stationary. When specialized to the…

Information Theory · Computer Science 2007-07-13 Young-Han Kim

This paper characterizes the capacity region of Gaussian MIMO broadcast channels (BCs) with per-antenna power constraint (PAPC). While the capacity region of MIMO BCs with a sum power constraint (SPC) was extensively studied, that under…

Information Theory · Computer Science 2017-05-18 Thuy M. Pham , Ronan Farrell , Le-Nam Tran

We consider the problem of covert communication over a state-dependent channel, where the transmitter has causal or noncausal knowledge of the channel states. Here, "covert" means that a warden on the channel should observe similar…

Information Theory · Computer Science 2017-08-09 Si-Hyeon Lee , Ligong Wang , Ashish Khisti , Gregory W. Wornell

A new outer bound on the capacity region of Gaussian interference channels is developed. The bound combines and improves existing genie-aided methods and is shown to give the sum-rate capacity for noisy interference as defined in this…

Information Theory · Computer Science 2016-11-18 Xiaohu Shang , Gerhard Kramer , Biao Chen

The multiple access channel (MAC) capacity with feedback is considered under feedback models designed to tease out which factors contribute to the MAC feedback capacity benefit. Comparing the capacity of a MAC with ``perfect'' feedback,…

Information Theory · Computer Science 2023-05-11 Oliver Kosut , Michelle Effros , Michael Langberg

The present paper is devoted to investigation of the classical capacity of infinite-dimensional quantum measurement channels. A number of usable conditions are introduced that enable us to apply previously obtained general results to…

Quantum Physics · Physics 2020-08-31 A. S. Holevo , A. A. Kuznetsova

This paper investigates covert communication over an additive white Gaussian noise (AWGN) channel in finite block length regime on the assumption of Gaussian codebooks. We first review some achievability and converse bounds on the…

Information Theory · Computer Science 2020-07-08 Xinchun Yu , Shuangqin Wei , Yuan Luo

The capacity region of the Finite-State Multiple Access Channel (FS-MAC) with feedback that may be an arbitrary time-invariant function of the channel output samples is considered. We characterize both an inner and an outer bound for this…

Information Theory · Computer Science 2009-11-23 Haim Permuter , Tsachy Weissman

Most practical communication links are bi-directional. In these models, since the source node also receives signals, its encoder has the option of computing its output based on the signals it received in the past. On the other hand, from a…

Information Theory · Computer Science 2009-11-24 Xiang He , Aylin Yener

In this paper, an achievability region and a converse region for the two-user Gaussian interference channel with noisy channel-output feedback (G-IC-NOF) are presented. The achievability region is obtained using a random coding argument and…

Information Theory · Computer Science 2016-11-18 Victor Quintero , Samir M. Perlaza , Iñaki Esnaola , Jean-Marie Gorce

The fact that the results for 2-receiver broadcast channels (BCs) are not generalized to the 3-receiver ones is of information theoretical importance. In this paper we study two classes of discrete memoryless BCs with non-causal side…

Information Theory · Computer Science 2014-08-19 Sajjad Bahrami , Ghosheh Abed Hodtani

Establishing the strong converse theorem for a communication channel confirms that the capacity of that channel, that is, the maximum achievable rate of reliable information communication, is the ultimate limit of communication over that…

Quantum Physics · Physics 2016-08-29 Tony Dorlas , Ciara Morgan

We consider communication over a multiple-input single-output (MISO) block fading channel in the presence of an independent noiseless feedback link. We assume that the transmitter and receiver have no prior knowledge of the channel state…

Information Theory · Computer Science 2018-03-16 Jinyuan Chen

The capacity of finite state channels (FSCs) with feedback has been shown to be a limit of a sequence of multi-letter expressions. Despite many efforts, a closed-form single-letter capacity characterization is unknown to date. In this…

Information Theory · Computer Science 2022-02-07 Andrea Grigorescu , Holger Boche , Rafael F. Schaefer , H. Vincent Poor

This paper studies the capacity of an $n$-dimensional vector Gaussian noise channel subject to the constraint that an input must lie in the ball of radius $R$ centered at the origin. It is known that in this setting the optimizing input…

Information Theory · Computer Science 2018-09-25 Alex Dytso , Mert Al , H. Vincent Poor , Shlomo Shamai
‹ Prev 1 8 9 10 Next ›