English
Related papers

Related papers: A note on outer bounds for broadcast channel

200 papers

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

We study the best known general inner bound[MAR '79] and outer bound[N-EG'07] for the capacity region of the two user discrete memory less channel. We prove that a seemingly stronger outer bound is identical to a weaker form of the outer…

Information Theory · Computer Science 2008-04-25 Chandra Nair , Vincent Wang Zizhou

An outer bound to the capacity region of the two-receiver discrete memoryless broadcast channel is given. The outer bound is tight for all cases where the capacity region is known. When specialized to the case of no common information, this…

Information Theory · Computer Science 2007-07-13 Chandra Nair , Abbas El Gamal

Outer bounds on the admissible source region for broadcast channels with dependent sources are developed and used to prove capacity results for several classes of sources and channels.

Information Theory · Computer Science 2009-02-16 Gerhard Kramer , Yingbin Liang , Shlomo Shamai

Two outer bounds on the admissible source region for broadcast channels with correlated sources are presented: the first one is strictly tighter than the existing outer bound by Gohari and Anantharam while the second one provides a complete…

Information Theory · Computer Science 2015-05-06 Kia Khezeli , Jun Chen

In this paper, we derive outer bounds on the capacity region of two classes of the general two-user discrete memoryless broadcast channels with side-information at the transmitter. The first class comprises the classical broadcast channel…

Information Theory · Computer Science 2011-10-11 K. G. Nagananda , Chandra R Murthy , Shalinee Kishore

We establish a new outer bound for the capacity region of product broadcast channels. This outer bound matches Marton's inner bound for a variety of classes of product broadcast channels whose capacity regions were previously unknown. These…

Information Theory · Computer Science 2026-04-01 Yanlin Geng , Amin Gohari , Chandra Nair , Yuanming Yu

Inner and outer bounds are established on the capacity region of two-sender, two-receiver interference channels where one transmitter knows both messages. The transmitter with extra knowledge is referred to as being cognitive. The inner…

Information Theory · Computer Science 2007-10-22 I. Maric , A. Goldsmith , G. Kramer , S. Shamai

Recently, Tian et al. [1] considered joint source-channel coding of transmitting a Gaussian source over $K$-user Gaussian broadcast channel, and derived an outer bound on the admissible distortion region. In [1], they stated "due to its…

Information Theory · Computer Science 2016-11-17 Lei Yu , Houqiang Li , Weiping Li

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

This paper investigates the joint source-channel coding problem of sending a memoryless source over a memoryless broadcast channel. An inner bound and several outer bounds on the admissible distortion region are derived, which respectively…

Information Theory · Computer Science 2018-06-11 Lei Yu , Houqiang Li , Weiping Li

We present a new technique to obtain outer-bounds on the capacity region of networks with ultra low-rate feedback. We establish a connection between the achievable rates in the forward channel and the minimum distortion that can be attained…

Information Theory · Computer Science 2021-05-11 Alireza Vahid

This paper studies a layered erasure model for two-user interference channels, which can be viewed as a simplified version of Gaussian fading interference channel. It is assumed that channel state information~(CSI) is only available at…

Information Theory · Computer Science 2016-01-26 Yan Zhu

We study the problem of coding over a general discrete memoryless broadcast channel controlled by random parameters. The parameters are available at the transmitter in a non-causal manner and are subject to a state masking constraint on the…

Information Theory · Computer Science 2018-10-30 Michael Dikshtein , Shlomo Shamai

This paper presents outerbounds for the two-user Gaussian fading broadcast channel. These outerbounds are based on Costa's entropy power inequality (Costa-EPI) and are formulated mathematically as a feasibility problem. For classes of the…

Information Theory · Computer Science 2011-02-17 Amin Jafarian , Sriram Vishwanath

This paper studies the two-user interference channel with unilateral source cooperation, which consists of two source-destination pairs that share the same channel and where one full-duplex source can overhear the other source through a…

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

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

This paper investigates the capacity regions of two-receiver broadcast channels where each receiver (i) has both common and private-message requests, and (ii) knows part of the private message requested by the other receiver as side…

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

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
‹ Prev 1 2 3 10 Next ›