English
Related papers

Related papers: The Capacity of the Gaussian Cooperative Two-user …

200 papers

This paper provides comprehensive coding and outer bound for the half-duplex multiple access channel with generalized feedback (MAC-GF). Two users communicate with one destination over a discrete memoryless channel using time division. Each…

Information Theory · Computer Science 2011-08-02 Ahmad Abu Al Haija , Mai Vu

Computing capacity of Gaussian Interference Channel (GIC) is complex since knowledge of input distributions is needed to find the mutual information terms in closed forms, which should be optimized over input distributions and associated…

Information Theory · Computer Science 2020-12-09 Amir K. Khandani

In this paper we study the multiple access channel (MAC) with combined cooperation and partial cribbing and characterize its capacity region. Cooperation means that the two encoders send a message to one another via a rate-limited link…

Information Theory · Computer Science 2014-04-04 Tal Kopetz , Haim Permuter , Shlomo Shamai

A two-user symmetric Gaussian Interference Channel (IC) is considered in which a noiseless unidirectional link connects one encoder to the other. Having a constant capacity, the additional link provides partial cooperation between the…

Information Theory · Computer Science 2009-09-16 Hossein Bagheri , Abolfazl S. Motahari , Amir K. Khandani

The interference channel with common information (IC-CI) consists of two transmit-receive pairs that communicate over a common noisy medium. Each transmitter has an individual message for its paired receiver, and additionally, both…

Information Theory · Computer Science 2012-03-01 Chinmay S. Vaze , Mahesh K. Varanasi

In the two-user Gaussian Strong Interference Channel (GSIC) with finite constellation inputs, it is known that relative rotation between the constellations of the two users enlarges the Constellation Constrained (CC) capacity region. In…

Information Theory · Computer Science 2015-03-17 G. Abhinav , B. Sundar Rajan

The capacity region of the two-user Gaussian Interference Channel (IC) is studied. Three classes of channels are considered: weak, one-sided, and mixed Gaussian IC. For the weak Gaussian IC, a new outer bound on the capacity region is…

Information Theory · Computer Science 2008-01-09 Abolfazl S. Motahari , Amir K. Khandani

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

A discrete memoryless generalized multiple access channel (GMAC) with confidential messages is studied, where two users attempt to transmit common information to a destination and each user also has private (confidential) information…

Information Theory · Computer Science 2007-07-13 Yingbin Liang , H. Vincent Poor

We characterize the capacity region to within 2 bits/s/Hz and the symmetric capacity to within 1 bit/s/Hz for the two-user Gaussian interference channel (IC) with feedback. We develop achievable schemes and derive a new outer bound to…

Information Theory · Computer Science 2010-05-20 Changho Suh , David Tse

We consider the General Gaussian Multiple Access Wire-Tap Channel (GGMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed eavesdropper. We define two suitable secrecy…

Information Theory · Computer Science 2007-07-13 Ender Tekin , Aylin Yener

This paper considers the two-user Gaussian Causal Cognitive Interference Channel (GCCIC), which consists of two source-destination pairs that share the same channel and where one full-duplex cognitive source can causally learn the message…

Information Theory · Computer Science 2016-11-15 Martina Cardone , Daniela Tuninetti , Raymond Knopp , Umer Salim

In this research report, 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…

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

We consider a Gaussian multiple-access channel (MAC) with an amplify-and-forward (AF) relay, where all nodes except the receiver have multiple antennas and the direct links between transmitters and receivers are neglected. Thus, spatial…

Information Theory · Computer Science 2015-03-20 Frederic Knabe , Omar Mohamed , Carolin Huppert

This article shows that the set of HK constraints correspond to projecting the intersection of two multiple access channels on its sup-spaces. A key property of HK constraints is that the private message of user 1 (or of user 2) is the last…

Information Theory · Computer Science 2020-12-15 Amir K. Khandani

The capacity of time-varying channels with periodic feedback at the transmitter is evaluated. It is assumed that the channel state information is perfectly known at the receiver and is fed back to the transmitter at the regular…

Information Theory · Computer Science 2007-07-13 Mehdi Ansari Sadrabadi , Mohammad Ali Maddah-Ali , Amir K. Khandani

For a two-user Gaussian multiple access channel (GMAC), frequency division multiple access (FDMA), a well known orthogonal-multiple-access (O-MA) scheme has been preferred to non-orthogonal-multiple-access (NO-MA) schemes since FDMA can…

Information Theory · Computer Science 2010-01-05 J. Harshan , B. Sundar Rajan

The two-user broadcast channel (BC) with receivers connected by bidirectional cooperation links of finite capacities, known as conferencing decoders, is considered. A novel capacity region outer bound is established based on multiple…

Information Theory · Computer Science 2025-08-12 Reza K. Farsani , Wei Yu

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

This paper studies a memoryless state-dependent multiple access channel (MAC) where two transmitters wish to convey a message to a receiver under the assumption of causal and imperfect channel state information at transmitters (CSIT) and…

Information Theory · Computer Science 2021-06-18 Lorenzo Miretti , Mari Kobayashi , David Gesbert , Paul de Kerret