English
Related papers

Related papers: On Discrete Alphabets for the Two-user Gaussian In…

200 papers

A generalized multiple access channel (GMAC) with one confidential message set is studied, where two users (users 1 and 2) attempt to transmit common information to a destination, and user 1 also has confidential information intended for…

Information Theory · Computer Science 2007-08-22 Yingbin Liang , H. Vincent Poor

We study achievable rates of reliable communication in a power-constrained two-way additive interference channel over the real alphabet where communication is disrupted by a power-constrained jammer. This models the wireless communication…

Information Theory · Computer Science 2020-01-10 Yihan Zhang , Shashank Vatedka , Sidharth Jaggi

In this work, we derive achievable rate regions for the three-user interference channels with asymmetric transmitter cooperation and various decoding capabilities at the receivers. The three-user channel facilitates different ways of…

Information Theory · Computer Science 2011-02-23 K. G. Nagananda , Chandra R. Murthy

This paper considers the problem of cognitive radios with partial-message information. Here, an interference channel setting is considered where one transmitter (the "cognitive" one) knows the message of the other ("legitimate" user)…

Information Theory · Computer Science 2008-12-31 G. Chung , S. Sridharan , S. Vishwanath , C. S. Hwang

In this paper we introduce the two-user asynchronous cognitive multiple access channel (ACMAC). This channel model includes two transmitters, an uninformed one, and an informed one which knows prior to the beginning of a transmission the…

Information Theory · Computer Science 2016-08-10 Michal Yemini , Anelia Somekh-Baruch , Amir Leshem

A generalization of the problem of writing on dirty paper is considered in which one transmitter sends a common message to multiple receivers. Each receiver experiences on its link an additive interference (in addition to the additive…

Information Theory · Computer Science 2007-07-13 Ashish Khisti , Uri Erez , Amos Lapidoth , Gregory Wornell

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 consider the problem of communicating over the general discrete memoryless broadcast channel (BC) with partially cooperating receivers. In our setup, receivers are able to exchange messages over noiseless conference links of finite…

Information Theory · Computer Science 2016-11-17 Ron Dabora , Sergio D. Servetto

This paper studies the problem of secure communication over broadcast channels under the individual secrecy constraints. That is, the transmitter wants to send two independent messages to two legitimate receivers in the presence of an…

Information Theory · Computer Science 2015-12-01 Yanling Chen , O. Ozan Koyluoglu , Aydin Sezgin

In this paper, we study the state-dependent two-user interference channel, where the state information is non-causally known at both transmitters but unknown to either of the receivers. We propose two coding schemes for the discrete…

Information Theory · Computer Science 2010-06-29 Lili Zhang , Jinhua Jiang , Shuguang Cui

The capacity region of the 2-user multi-input multi-output (MIMO) Gaussian interference channel (IC) is characterized to within a constant gap that is independent of the channel matrices for the general case of the MIMO IC with an arbitrary…

Information Theory · Computer Science 2015-03-18 Sanjay Karmakar , Mahesh K. Varanasi

The two-user Gaussian interference channel (GIC) has been extensively studied in the literature during the last four decades. The full characterization of the capacity region of the GIC is a long-standing open problem, except the case of…

Information Theory · Computer Science 2018-04-10 Wasim Huleihel , Neri Merhav

In this paper, a new and general version of Gaussian channel in presence of two-sided state information correlated to the channel input and noise is considered. Determining a general achievable rate for the channel and obtaining the…

Information Theory · Computer Science 2015-07-20 Nima S. Anzabi-Nezhad , Ghosheh Abed Hodtani , Mohammad Molavi Kakhki

In this paper, we consider the discrete memoryless interference channel with common information, in which two senders need deliver not only private messages but also certain common messages to their corresponding receivers. We derive an…

Information Theory · Computer Science 2007-07-13 Jinhua Jiang , Yan Xin , Hari Krishna Garg

This paper studies incremental relay strategies for a two-user Gaussian relay-interference channel with an in-band-reception and out-of-band-transmission relay, where the link between the relay and the two receivers is modelled as a…

Information Theory · Computer Science 2012-12-13 Lei Zhou , Wei Yu

In this paper, we study the problem of secret communication over a multiple-access channel with a common message. Here, we assume that two transmitters have confidential messages, which must be kept secret from the wiretapper (the second…

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

In this paper, we investigate the half-duplex cooperative communication scheme of a two user Gaussian interference channel. We develop achievable region and outer bound for the case when the system allow either transmitter or receiver…

Information Theory · Computer Science 2009-01-20 Yong Peng , Dinesh Rajan

This work studies the capacity region of a two-user ergodic interference channel with fading, where only one of the users is subject to interference from the other user, and the channel state information (CSI) is only available at the…

Information Theory · Computer Science 2009-11-06 Yan Zhu , Dongning Guo

In this paper, the available spatial Degrees-Of-Freedoms (DOF) in single antenna systems is exploited. A new coding scheme is proposed in which several data streams having fractional multiplexing gains are sent by transmitters and…

Information Theory · Computer Science 2016-11-18 Abolfazl Seyed Motahari , Shahab Oveis Gharan , Mohammad-Ali Maddah-Ali , Amir Keyvan Khandani

We study private broadcasting of two messages to two groups of receivers over independent parallel channels. One group consists of an arbitrary number of receivers interested in a common message, whereas the other group has only one…

Information Theory · Computer Science 2013-01-01 Ashish Khisti , Tie Liu