English
Related papers

Related papers: On Layered Erasure Interference Channels without C…

200 papers

In this paper, capacity bounds for the two-user Interference Channel (IC) with cooperative receivers via conferencing links of finite capacities is investigated. The capacity results known for this communication scenario are limited to a…

Information Theory · Computer Science 2015-12-17 Reza K. Farsani , Amir K. Khandani

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 first propose two coding schemes for the discrete…

Information Theory · Computer Science 2015-03-19 Lili Zhang , Jinhua Jiang , Shuguang Cui

In this paper, the capacity region of the Layered Packet Erasure Broadcast Channel (LPE-BC) with Channel Output Feedback (COF) available at the transmitter is investigated. The LPE-BC is a high-SNR approximation of the fading Gaussian BC…

Information Theory · Computer Science 2019-01-08 Siyao Li , Daniela Tuninetti , Natasha Devroye

We consider the N-user broadcast erasure channel with public feedback and side information. Before the beginning of transmission, each receiver knows a function of the messages of some of the other receivers. This situation arises naturally…

Information Theory · Computer Science 2014-06-16 A. Papadopoulos , L. Georgiadis

In this paper, we first present an outer bound for a general interference channel with a cognitive relay, i.e., a relay that has non-causal knowledge of both independent messages transmitted in the interference channel. This outer bound…

Information Theory · Computer Science 2015-03-17 Stefano Rini , Daniela Tuninetti , Natasha Devroye

An outer bound to the two-receiver discrete memoryless broadcast channel is presented. We compare it to the known outer bounds and show that the outer bound presented is at least as tight as the existing bounds.

Information Theory · Computer Science 2008-07-24 Chandra 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

This paper derives an outer bound on the capacity region of a general memoryless interference channel with an arbitrary number of users. The derivation follows from a generalization of the techniques developed by Kramer and by Etkin et al…

Information Theory · Computer Science 2016-11-17 Daniela Tuninetti

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

In general, the different links of a broadcast channel may experience different fading dynamics and, potentially, unequal or hybrid channel state information (CSI) conditions. The faster the fading and the shorter the fading block length,…

Information Theory · Computer Science 2017-09-12 Mohamed Fadel , Aria Nosratinia

This work proposes a novel outer bound for the Gaussian cognitive interference channel in strong interference at the primary receiver based on the capacity of a multi-antenna broadcast channel with degraded message set. It then shows that…

Information Theory · Computer Science 2015-03-19 Stefano Rini , Daniela Tuninetti , Natasha Devroye

To study the effect of lack of up-to-date channel state information at the transmitters (CSIT), we consider two-user binary fading interference channels with Delayed-CSIT. We characterize the capacity region for such channels under…

Information Theory · Computer Science 2016-11-17 Alireza Vahid , Mohammad Ali Maddah-Ali , Amir Salman Avestimehr

We derive a new outer bound on the capacity region of broadcast traffic in multiple input broadcast packet erasure channels with feedback, and extend this outer bound to packet erasure relay networks with feedback. We show the tightness of…

Information Theory · Computer Science 2019-05-17 Quan Geng , Hieu T. Do , Rui Wu , Mindi Yuan , Yun Li , Wei Ding

We investigate the delay limited secrecy capacity of the flat fading channel under two different assumptions on the available transmitter channel state information (CSI). The first scenario assumes perfect prior knowledge of both the main…

Information Theory · Computer Science 2016-11-17 Karim Khalil , O. Ozan Koyluoglu , Hesham El Gamal , Moustafa Youssef

A class of cognitive interference channel with state is investigated, in which two transmitters (transmitters 1 and 2) communicate with two receivers (receivers 1 and 2) over an interference channel. The two transmitters jointly transmit a…

Information Theory · Computer Science 2012-07-10 Ruchen Duan Yingbin Liang

In this paper, capacity inner and outer bounds are established for the multiuser channels with Channel State Information (CSI) known non-causally at the transmitters: The Multiple Access Channel (MAC), the Broadcast Channel (BC) with common…

Information Theory · Computer Science 2013-02-17 Reza K. Farsani , Farokh Marvasti

A wideband fading channel is considered with causal channel state information (CSI) at the transmitter and no receiver CSI. A simple orthogonal code with energy detection rule at the receiver (similar to [6]) is shown to achieve the…

Information Theory · Computer Science 2007-07-13 Shashi Borade , Lizhong Zheng

This paper derives outer bounds on the secrecy capacity region of the 2-user Z interference channel (Z-IC) with rate-limited unidirectional cooperation between the transmitters. First, the model is studied under the linear deterministic…

Information Theory · Computer Science 2016-04-12 Parthajit Mohapatra , Chandra R. Murthy , Jemin Lee

We consider the two-receiver memoryless broadcast channel with states where each receiver requests both common and private messages, and may know part of the private message requested by the other receiver as receiver message side…

Information Theory · Computer Science 2016-11-17 Behzad Asadi , Lawrence Ong , Sarah J. Johnson

In this letter, we characterize the performance of broadcast approach with continuum of transmission layers in random wireless networks where the channel state information (CSI) is assumed to be known only at the receiver. By modeling the…

Information Theory · Computer Science 2019-04-09 Praful D. Mankar , Harpreet S. Dhillon