English
Related papers

Related papers: A note on outer bounds for broadcast channel

200 papers

This paper provides an explicit expression for the capacity region of the two-user broadcast Z channel and proves that the optimal boundary can be achieved by independent encoding of each user. Specifically, the information messages…

Information Theory · Computer Science 2008-10-20 Bike Xie , Miguel Griot , Andres I. Vila Casado , Richard D. Wesel

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 paper studies the problem of secure communication over the broadcast channel with receiver side information under the lens of individual secrecy constraints. That is, the transmitter wants to send two independent messages to two…

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

Achievable rate regions and outer bounds are derived for three-user interference channels where the transmitters cooperate in a unidirectional manner via a noncausal message-sharing mechanism. The three-user channel facilitates different…

Information Theory · Computer Science 2016-11-17 K. G. Nagananda , Parthajit Mohapatra , Chandra R. Murthy , Shalinee Kishore

We derive the capacity region of the degraded broadcast channel (DBC) subject to the constraint that the communication is not detected by an adversary, the Warden. Our capacity result is in a computable form and numerical results show that…

Information Theory · Computer Science 2026-05-12 Yossef Steinberg , Michèle Wigger

A channel is degradable if there exists a second channel that maps the output state of the channel to the environment state. These channels satisfy the property that the output state contains more information about the input than the…

Quantum Physics · Physics 2010-08-19 Bill Rosgen

The goal of quantum channel discrimination and estimation is to determine the identity of an unknown channel from a discrete or continuous set, respectively. The query complexity of these tasks is equal to the minimum number of times one…

Quantum Physics · Physics 2026-02-25 Zixin Huang , Johannes Jakob Meyer , Theshani Nuradha , Mark M. Wilde

We define the notions of outer medians and outer median triangles. We show that outer median triangles enjoy similar properties to that of the median triangle.

History and Overview · Mathematics 2013-05-16 Árpád Bényi , Branko Ćurgus

In this short note, we show that the inradius of a convex body is comparable to its volume divided by its surface area. We also give a simple formula, in terms of its volume and inradius, that is comparable to the volume of its intersection…

Metric Geometry · Mathematics 2024-02-13 Benedict Sewell

This paper is concerned with general interference channels characterized by a sequence of transition (conditional) probabilities. We present a general formula for the capacity region of the interference channel with two pairs of users. The…

Information Theory · Computer Science 2012-02-03 Lei Lin , Xiao Ma , Xiujie Huang , Baoming Bai

When experimentally learning the action of a continuous variable quantum process by probing it with inputs, there will often be some restriction on the input states used. One experimentally simple way to probe a quantum channel is using low…

Quantum Physics · Physics 2025-10-20 Jason L. Pereira , Quntao Zhuang , Leonardo Banchi

In this short note we explain how one can use established results to prove various versions of the positive mass theorem for initial data sets with boundary, in dimensions less than 8.

General Relativity and Quantum Cosmology · Physics 2022-01-11 Gregory J. Galloway , Dan A. Lee

We consider a state-dependent multiaccess channel (MAC) with state non-causally known to some encoders. We derive an inner bound for the capacity region in the general discrete memoryless case and specialize to a binary noiseless case. In…

Information Theory · Computer Science 2008-03-30 Shiva Prasad Kotagiri , J. Nicholas Laneman

Seymour's Second-Neighborhood Conjecture states that every directed graph whose underlying graph is simple has at least one vertex $v$ such that the number of vertices of out-distance $2$ from $v$ is at least as large as the number of…

Combinatorics · Mathematics 2019-07-31 Farid Bouya , Bogdan Oporowski

This paper investigates the joint source-channel coding problem of sending two correlated memoryless sources with common part over a memoryless multiple access channel (MAC). An inner bound and two outer bounds on the achievable distortion…

Information Theory · Computer Science 2016-12-13 Lei Yu , Houqiang Li , Chang Wen Chen

We consider the discrete memoryless degraded broadcast channels. We prove that the error probability of decoding tends to one exponentially for rates outside the capacity region and derive an explicit lower bound of this exponent function.…

Information Theory · Computer Science 2015-04-23 Yasutada Oohama

We identify the common underlying form of the capacity expression that is applicable to both cases where causal or non-causal side information is made available to the transmitter. Using this common form we find that for the single user…

Information Theory · Computer Science 2007-07-13 Syed A. Jafar

We consider weighted Hardy inequalities involving the distance function to the boundary of a domain in the $N$-dimensional Euclidean space with nonempty boundary. We give a lower bound for the corresponding best Hardy constant for a domain…

Analysis of PDEs · Mathematics 2023-07-06 Ujjal Das , Yehuda Pinchover

Young's integral inequality is complemented with an upper bound to the remainder. The new inequality turns out to be equivalent to Young's inequality, and the cases in which the equality holds become particularly transparent in the new…

General Mathematics · Mathematics 2008-09-11 E. Minguzzi

We extend Shannon's result on the capacity of channels with state information to multiple user channels. More specifically, we characterize the capacity (region) of degraded broadcast channels and physically degraded relay channels where…

Information Theory · Computer Science 2009-09-29 Styrmir Sigurjonsson , Young-Han Kim