English
Related papers

Related papers: The Gaussian MAC with Conferencing Encoders

200 papers

In this paper, we study the problem of secret communication over a Compound Multiple Access Channel (MAC). In this channel, we assume that one of the transmitted messages is confidential that is only decoded by its corresponding receiver…

Information Theory · Computer Science 2016-11-17 Hassan Zivari-Fard , Bahareh Akhbari , Mahmoud Ahmadian-Attari , Mohammad Reza Aref

In the earlier version of this paper, it was wrongly claimed that time-sharing is required to achieve the capacity region of the Gaussian interference channel to within one bit, especially at corner points. The flaw in the argument of the…

Information Theory · Computer Science 2015-03-17 Peyman Razaghi , Giuseppe Caire

In this paper we consider a multiple access channel (MAC) with partial cribbing encoders. This means that each of two encoders obtains a deterministic function of the other encoder output with or without delay. The partial cribbing scheme…

Information Theory · Computer Science 2011-03-22 Haim Permuter , Himanshu Asnani

Communication rates over quantum channels can be boosted by entanglement, via superadditivity phenomena or entanglement assistance. Superadditivity refers to the capacity improvement from entangling inputs across multiple channel uses.…

Quantum Physics · Physics 2022-03-14 Haowei Shi , Quntao Zhuang

This paper investigates the joint source-channel coding problem of sending two correlated memoryless sources with common part over a memoryless multiple access channel (MAC). An inner bound and two outer bounds on the achievable distortion…

Information Theory · Computer Science 2016-12-13 Lei Yu , Houqiang Li , Chang Wen Chen

Gaussian channels with memory and with noiseless feedback have been widely studied in the information theory literature. However, a coding scheme to achieve the feedback capacity is not available. In this paper, a coding scheme is proposed…

Information Theory · Computer Science 2007-07-13 Jialing Liu , Nicola Elia

We consider a two-user state-dependent multiaccess channel in which only one of the encoders is informed, non-causally, of the channel states. Two independent messages are transmitted: a common message transmitted by both the informed and…

Information Theory · Computer Science 2016-11-18 Abdellatif Zaidi , Shiva Prasad Kotagiri , J. Nicholas Laneman , Luc Vandendorpe

We consider a two-user state-dependent multiaccess channel in which the states of the channel are known non-causally to one of the encoders and only strictly causally to the other encoder. Both encoders transmit a common message and, in…

Information Theory · Computer Science 2012-01-17 Abdellatif Zaidi , Pablo Piantanida , Shlomo Shamai

In this paper, we derive new closed-form expressions for the gradient of the mutual information with respect to arbitrary parameters of the two-user multiple access channel (MAC). The derived relations generalize the fundamental relation…

Information Theory · Computer Science 2014-11-07 Samah A. M. Ghanem

For two-user interference channels, the capacity is known for the case where interference is stronger than the desired signal. Moreover, it is known that if the interference is above a certain level, it does not reduce the capacity at all.…

Information Theory · Computer Science 2012-06-21 Frederic Knabe , Aydin Sezgin

This paper explores the two-user Gaussian interference channel through the lens of a natural deterministic channel model. The main result is that the deterministic channel uniformly approximates the Gaussian channel, the capacity regions…

Information Theory · Computer Science 2008-07-22 Guy Bresler , David Tse

Two-way communication is prevalent and its fundamental limits are first studied in the point-to-point setting by Shannon [1]. One natural extension is a two-way interference channel (IC) with four independent messages: two associated with…

Information Theory · Computer Science 2017-09-05 Changho Suh , Jaewoong Cho , David Tse

We consider a problem where a memoryless bi-variate Gaussian source is to be transmitted over an additive white Gaussian multiple-access channel with two transmitting terminals and one receiving terminal. The first transmitter only sees the…

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

In this work, we prove that a positive secure degree of freedom is achievable for a large class of Gaussian channels as long as the channel is not degraded and the channel is fully connected. This class includes the MAC wire-tap channel,…

Information Theory · Computer Science 2016-11-17 Xiang He , Aylin Yener

This paper is motivated by a sensor network on a correlated field where nearby sensors share information, and can thus assist rather than interfere with one another. We consider a special class of two-user Gaussian interference channels…

Information Theory · Computer Science 2007-07-13 Wei Wu , Sriram Vishwanath , Ari Arapostathis

The full solution of the optimization problem giving the Gaussian capacity of the single-mode fiducial Gaussian quantum channel is provided. Since it was shown that the Gaussian capacity of an arbitrary (phase-sensitive or insensitive)…

Quantum Physics · Physics 2016-09-19 Joachim Schäfer , Evgueni Karpov , Oleg V. Pilyavets , Nicolas J. Cerf

We study the throughput capacity region of the Gaussian multi-access (MAC) fading channel with perfect channel state information (CSI) at the receiver and at the transmitters, at low power regime. We show that it has a multidimensional…

Information Theory · Computer Science 2013-11-01 Zouheir Rezki , Mohamed-Slim Alouini

This paper provides upper and lower bounds on list sizes of list decoding for two-user oblivious arbitrarily varying multiple access channels (AVMACs). An oblivious AVMAC consists of two users who wish to transmit messages (without…

Information Theory · Computer Science 2020-01-10 Yihan Zhang

We develop a new method for showing the optimality of the Gaussian distribution in multiterminal information theory problems. As an application of this method we show that Marton's inner bound achieves the capacity of the vector Gaussian…

Information Theory · Computer Science 2012-02-02 Yanlin Geng , Chandra Nair

It has been recently shown by Lapidoth and Steinberg that strictly causal state information can be beneficial in multiple access channels (MACs). Specifically, it was proved that the capacity region of a two-user MAC with independent…

Information Theory · Computer Science 2016-11-18 Min Li , Osvaldo Simeone , Aylin Yener
‹ Prev 1 3 4 5 6 7 10 Next ›