English
Related papers

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

200 papers

For the additive Gaussian noise channel with average codeword power constraint, sparse superposition codes and adaptive successive decoding is developed. Codewords are linear combinations of subsets of vectors, with the message indexed by…

Information Theory · Computer Science 2010-06-22 Andrew R Barron , Antony Joseph

We consider the problem of transmitting a bivariate Gaussian source over a two-user additive Gaussian multiple-access channel with feedback. Each of the transmitters observes one of the source components and tries to describe it to the…

Information Theory · Computer Science 2007-07-16 Amos Lapidoth , Stephan Tinguely

New achievable rate regions are derived for the two-user additive white Gaussian multiple-access channel with noisy feedback. The regions exhibit the following two properties. Irrespective of the (finite) Gaussian feedback-noise variances,…

Information Theory · Computer Science 2010-04-13 Amos Lapidoth , Michele A. Wigger

Quantum channels can be activated by a kind of channels whose quantum capacity is zero. This activation effect might be useful to overcome noise of channels by attaching other channels which can enhance the capacity of a given channel. In…

Quantum Physics · Physics 2018-07-26 Youngrong Lim , Soojoon Lee

A conjecture arising naturally in the investigation of additivity of classical information capacity of quantum channels states that the maximal purity of outputs from a quantum channel, as measured by the p-norm, should be multiplicative…

Quantum Physics · Physics 2015-06-26 R. F. Werner , A. S. Holevo

We consider the Gaussian channel with power constraint P. A gap exists between the channel capacity and the highest achievable rate of equiprobable uniformly spaced signal. Several approaches enable to overcome this limitation such as…

Information Theory · Computer Science 2015-03-17 Hugo Meric

We firstly extend the interpretation of feedback communication over stationary finite dimensional Gaussian channels as feedback control systems by showing that, the problem of finding stabilizing feedback controllers with maximal reliable…

Information Theory · Computer Science 2015-12-01 Chong Li , Nicola Elia

We characterize the fundamental limits of transmission of information over a Gaussian multiple access channel (MAC) with the use of variable-length feedback codes and under a non-vanishing error probability formalism. We develop new…

Information Theory · Computer Science 2018-01-10 Lan V. Truong , Vincent Y. F. Tan

We develop a new upper bound on the capacity of the relay channel that is tighter than previously known upper bounds. This upper bound is proved using traditional weak converse techniques involving mutual information inequalities and…

Information Theory · Computer Science 2022-04-01 Abbas El Gamal , Amin Gohari , Chandra Nair

Consider a memoryless relay channel, where the relay is connected to the destination with an isolated bit pipe of capacity $C_0$. Let $C(C_0)$ denote the capacity of this channel as a function of $C_0$. What is the critical value of $C_0$…

Information Theory · Computer Science 2018-10-09 Xiugang Wu , Leighton Pate Barnes , Ayfer Ozgur

For all 1 < p < 2, we demonstrate the existence of quantum channels with non-multiplicative maximal p-norms. Equivalently, the minimum output Renyi entropy of order p of a quantum channel is not additive for all 1 < p < 2. The violations…

Quantum Physics · Physics 2011-10-25 Patrick Hayden

It is known that for a discrete channel with correlated additive noise, the ordinary capacity with or without feedback both equal $ \log q-\mathcal{H} (Z) $, where $ \mathcal{H}(Z) $ is the entropy rate of the noise process $ Z $ and $ q $…

Information Theory · Computer Science 2020-06-02 Amir Saberi , Farhad Farokhi , Girish N. Nair

The capacity of the Gaussian cognitive interference channel, a variation of the classical two-user interference channel where one of the transmitters (referred to as cognitive) has knowledge of both messages, is known in several parameter…

Information Theory · Computer Science 2016-11-17 Stefano Rini , Daniela Tuninetti , Natasha Devroye

The sum-rate capacity of the parallel Gaussian interference channel is shown to be achieved by independent transmission across sub-channels and treating interference as noise in each sub-channel if the channel coefficients and power…

Information Theory · Computer Science 2009-03-04 Xiaohu Shang , Biao Chen , Gerhard Kramer , H. Vincent Poor

We consider capacity of discrete-time channels with feedback for the general case where the feedback is a time-invariant deterministic function of the output samples. Under the assumption that the channel states take values in a finite…

Information Theory · Computer Science 2009-09-29 Haim Permuter , Tsachy Weissman , Andrea Goldsmith

A modification is proposed for the formula known from the literature that characterizes the boundary of the capacity region of Gaussian multiaccess fading channels. The modified version takes into account potentially negative arguments of…

Information Theory · Computer Science 2008-10-22 Mohamed Shaqfeh , Norbert Goertz

In this paper, we propose an approach to numerically compute the feedback capacity of stationary finite dimensional Gaussian channels and construct (arbitrarily close to) capacity-achieving feedback codes. In particular, we first extend the…

Information Theory · Computer Science 2018-01-15 Chong Li , Nicola Elia

In this paper the cognitive interference channel with a common message, a variation of the classical cognitive interference channel in which the cognitive message is decoded at both receivers, is studied. For this channel model new outer…

Information Theory · Computer Science 2012-08-21 Stefano Rini , Carolin Huppert

The underwater acoustic channel is characterized by a path loss that depends not only on the transmission distance, but also on the signal frequency. As a consequence, transmission bandwidth depends on the transmission distance, a feature…

Information Theory · Computer Science 2016-11-17 Daniel E. Lucani , Milica Stojanovic , Muriel Médard

Under which condition is quantization optimal? We address this question in the context of the additive uniform noise channel under peak amplitude and power constraints. We compute analytically the capacity-achieving input distribution as a…

Information Theory · Computer Science 2025-01-28 Jonas Stapmanns , Catarina Dias , Luke Eilers , Jean-Pascal Pfister
‹ Prev 1 3 4 5 6 7 10 Next ›