English
Related papers

Related papers: Error Exponents for the Gaussian Channel with Acti…

200 papers

The performance of Neyman-Pearson detection of correlated stochastic signals using noisy observations is investigated via the error exponent for the miss probability with a fixed level. Using the state-space structure of the signal and…

Information Theory · Computer Science 2016-11-17 Youngchul Sung , Lang Tong , H. Vincent Poor

Through refined asymptotic analysis based on the normal approximation, we study how higher-order coding performance depends on the mean power as well as on finer statistics of the input power. We introduce a multifaceted power model in…

Information Theory · Computer Science 2026-05-13 Adeel Mahmood , Aaron B. Wagner

This paper adds to the understanding of the capacity region of the Gaussian interference channel. To this end, the capacity region of the one-sided Gaussian interference channel is first fully characterized. This is accomplished by…

Information Theory · Computer Science 2015-09-22 Mojtaba Vaezi , H. Vincent Poor

Consider a Gaussian relay network where a source node communicates to a destination node with the help of several layers of relays. Recent work has shown that compress-and-forward based strategies can achieve the capacity of this network…

Information Theory · Computer Science 2015-07-16 Ritesh Kolte , Ayfer Özgür , Abbas El Gamal

We derive a single-letter formula for the zero-rate reliability (error exponent) of a finite-state channel whose state variable depends deterministically (and recursively) on past channel inputs, where the code complies with a given channel…

Information Theory · Computer Science 2016-11-15 Neri Merhav

We consider the transmission of a memoryless bivariate Gaussian source over an average-power-constrained one-to-two Gaussian broadcast channel. The transmitter observes the source and describes it to the two receivers by means of an…

Information Theory · Computer Science 2009-03-20 Shraga Bross , Amos Lapidoth , Stephan Tinguely

In this paper, we establish the connections of the fundamental limitations in feedback communication, estimation, and feedback control over Gaussian channels, from a unifying perspective for information, estimation, and control. The optimal…

Information Theory · Computer Science 2009-10-05 Jialing Liu , Nicola Elia

Finding a computable expression for the feedback capacity of channels with colored Gaussian, additive noise is a long standing open problem. In this paper, we solve this problem in the scenario where the channel has multiple inputs and…

Information Theory · Computer Science 2023-01-20 Oron Sabag , Victoria Kostina , Babak Hassibi

We determine the exact error and strong converse exponents of shared randomness-assisted channel simulation in worst case total-variation distance. Namely, we find that these exponents can be written as simple optimizations over the R\'enyi…

Information Theory · Computer Science 2024-10-10 Aadil Oufkir , Michael X. Cao , Hao-Chung Cheng , Mario Berta

The optimal power allocation that maximizes the secrecy capacity of block fading Gaussian (BF-Gaussian) networks with causal channel state information (CSI), M-block delay tolerance and a frame based power constraint is examined. In…

Information Theory · Computer Science 2014-01-28 Arsenia Chorti , Katerina Papadaki , H. Vincent Poor

Assuming noisy feedback channels, this paper investigates the data transmission efficiency and robustness of different automatic repeat request (ARQ) schemes using adaptive power allocation. Considering different block-fading channel…

Information Theory · Computer Science 2013-10-16 Behrooz Makki , Alexandre Graell i Amat , Thomas Eriksson

Error and erasure exponents for the broadcast channel with degraded message sets are analyzed. The focus of our error probability analysis is on the main receiver where, nominally, both messages are to be decoded. A two-step decoding…

Information Theory · Computer Science 2015-01-28 Vincent Y. F. Tan

In this article, we are proposing a closed-form solution for the capacity of the single quantum channel. The Gaussian distributed input has been considered for the analytical calculation of the capacity. In our previous couple of papers, we…

Information Theory · Computer Science 2023-02-17 Mouli Chakraborty , Harun Siljak , Indrakshi Dey , Nicola Marchetti

Inner and outer bounds are derived on the optimal performance of fixed length block codes on discrete memoryless channels with feedback and errors-and-erasures decoding. First an inner bound is derived using a two phase encoding scheme with…

Information Theory · Computer Science 2020-01-03 Baris Nakiboglu , Lizhong Zheng

In this paper, random coding error exponents and cutoff rate are studied for noncoherent Rician fading channels, where neither the receiver nor the transmitter has channel side information. First, it is assumed that the input is subject…

Information Theory · Computer Science 2016-11-18 Mustafa Cenk Gursoy

Consider the following unequal error protection scenario. One special message, dubbed the "red alert" message, is required to have an extremely small probability of missed detection. The remainder of the messages must keep their average…

Information Theory · Computer Science 2016-11-18 Bobak Nazer , Yanina Shkel , Stark C. Draper

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

We show how adaptive protocols of quantum and private communication through bosonic Gaussian channels can be simplified into much easier block versions that involve resource states with finite energy. This is achieved by combining the…

Quantum Physics · Physics 2018-10-17 Riccardo Laurenza , Samuel L. Braunstein , Stefano Pirandola

Recent outer bounds on the capacity region of Gaussian interference channels are generalized to $m$-user channels with $m>2$ and asymmetric powers and crosstalk coefficients. The bounds are again shown to give the sum-rate capacity for…

Information Theory · Computer Science 2008-01-16 Xiaohu Shang , Gerhard Kramer , Biao Chen

While the channel capacity reflects a theoretical upper bound on the achievable information transmission rate in the limit of infinitely many bits, it does not characterise the information transfer of a given encoding routine with finitely…

Neurons and Cognition · Quantitative Biology 2017-04-05 Sebastian Weichwald , Tatiana Fomina , Bernhard Schölkopf , Moritz Grosse-Wentrup
‹ Prev 1 3 4 5 6 7 10 Next ›