English
Related papers

Related papers: On the Capacity of the Cognitive Interference Chan…

200 papers

This paper considers a Gaussian broadcast channel with two unmatched degraded components, three particular messages, and a common message that is intended for all three receivers. It is shown that for this channel superposition coding and…

Information Theory · Computer Science 2009-11-04 Ramy H. Gohary , Timothy N. Davidson

An Interference Channel with Generalized Feedback (IFC-GF) is a model for a wireless network where several source-destination pairs compete for the same channel resources, and where the sources have the ability to sense the current channel…

Information Theory · Computer Science 2010-06-10 Echo Yang , Daniela Tuninetti

This paper considers the problem of the multiple-input multiple-output (MIMO) Gaussian broadcast channel with two receivers (receivers 1 and 2) and two messages: a common message intended for both receivers and a confidential message…

Information Theory · Computer Science 2016-11-17 Hung D. Ly , Tie Liu , Yingbin Liang

Previous works established the capacity region for some special cases of discrete memoryless degraded cognitive interference channel (CIC) with unidirectional destination cooperation (UDC). In this letter, we characterize the capacity…

Information Theory · Computer Science 2018-01-23 Mohammad Kazemi

The effect of "good", point-to-point capacity achieving, code sequences on an additional signal, of bounded variance, transmitted over the additive Gaussian noise channel is examined. For such code sequences, it is shown that their effect,…

Information Theory · Computer Science 2018-04-18 Ronit Bustin , H. Vincent Poor , Shlomo Shamai

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

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

We consider the two-user interference channel with rate-limited feedback. Related prior works focus on the case where feedback links have infinite capacity, while no research has been done for the rate-limited feedback problem. Several new…

Information Theory · Computer Science 2012-05-08 Alireza Vahid , Changho Suh , Amir Salman Avestimehr

A long-standing problem on the classical capacity of bosonic Gaussian channels has recently been resolved by proving the minimum output entropy conjecture. It is also known that the ultimate capacity quantified by the Holevo bound can be…

Quantum Physics · Physics 2015-05-07 Jaehak Lee , Se-Wan Ji , Jiyong Park , Hyunchul Nha

It is well known that the capacity region of an average transmit power constrained Gaussian Broadcast Channel (GBC) with independent noise realizations at the receivers is enlarged by the presence of causal noiseless feedback. Capacity…

Information Theory · Computer Science 2020-09-21 Aditya Narayan Ravi , Sibi Raj B. Pillai , Vinod Prabhakaran , Michèle Wigger

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 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 considers a Gaussian channel with one transmitter and two receivers. The goal is to maximize the communication rate at the intended/primary receiver subject to a disturbance constraint at the unintended/secondary receiver. The…

Information Theory · Computer Science 2016-03-25 Alex Dytso , Ronit Bustin , Daniela Tuninetti , Natasha Devroye , H. Vincent Poor , Shlomo Shamai

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

We study the interference channel with a signal cognitive relay. A signal cognitive relay knows the transmit signals (but not the messages) of the sources non-causally, and tries to help them communicating with their respective…

Information Theory · Computer Science 2010-01-13 Anas Chaaban , Aydin Sezgin

We extend previous results on covert communication over the additive white Gaussian noise channel to two other types of additive noise channels. The first is the Gaussian channel with memory, where the noise sequence is a Gaussian vector…

Information Theory · Computer Science 2023-03-22 Cécile Bouette , Laura Luzzi , Ligong Wang

This paper considers the problem of channel coding over Gaussian intersymbol interference (ISI) channels with a given metric decoding rule. Specifically, it is assumed that the mismatched decoder has an incorrect assumption on the impulse…

Information Theory · Computer Science 2017-06-20 Wasim Huleihel , Salman Salamatian , Neri Merhav , Muriel Médard

This work considers the corner points of the capacity region of a two-user Gaussian interference channel (GIC). In a two-user GIC, the rate pairs where one user transmits its data at the single-user capacity (without interference), and the…

Information Theory · Computer Science 2015-04-09 Igal Sason

In multi-user information theory it is often assumed that every node in the network possesses all codebooks used in the network. This assumption is however impractical in distributed ad-hoc and cognitive networks. This work considers the…

Information Theory · Computer Science 2014-01-23 Alex Dytso , Daniela Tuninetti , Natasha Devroye

This article characterizes new boundary points on the capacity region of certain classes of more capable broadcast channels (BC) with uni-directional cooperation from the stronger to the weaker receiver. The new boundary points are achieved…

Information Theory · Computer Science 2026-01-14 Nicolas Le Gouic , Yossef Steinberg , Michèle Wigger