相关论文: A note on outer bounds for broadcast channel

The fact that the results for 2-receiver broadcast channels (BCs) are not generalized to the 3-receiver ones is of information theoretical importance. In this paper we study two classes of discrete memoryless BCs with non-causal side…

We obtain upper bounds for the isoperimetric quotients of extrinsic balls of submanifolds in ambient spaces which have a lower bound on their radial sectional curvatures. The submanifolds are themselves only assumed to have lower bounds on…

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…

In order to provide a guaranteed precision and a more accurate judgement about the true value of the Cram\'{e}r-Rao bound and its scaling behavior, an upper bound (equivalently a lower bound on the quantum Fisher information) for precision…

Despite considerable progress on the information-theoretic broadcast channel, the capacity region of fading broadcast channels with channel state known at the receivers but unknown at the transmitter remains unresolved. We address this…

Often some interesting or simply curious points are left out when developing a theory. It seems that one of them is the existence of an upper bound for the fraction of area of a convex and closed plane area lying outside a circle with which…

This paper establishes inner bounds on the secrecy capacity regions for the general 3-receiver broadcast channel with one common and one confidential message sets. We consider two setups. The first is when the confidential message is to be…

This work investigates the secrecy capacity of the Wiretap Broadcast Channel (WBC) with an external eavesdropper where a source wishes to communicate two private messages over a Broadcast Channel (BC) while keeping them secret from the…

We study a special class of the cognitive radio channel in which the receiver of the cognitive pair does not suffer interference from the primary user. Previously developed general encoding schemes for this channel are complex as they…

A lower bound on the amount of noise that must be added to a GHZ-like entangled state to make it separable (also called the random robustness) is found using the transposition condition. The bound is applicable to arbitrary numbers of…

We study the two-user broadcast channel with degraded message sets and derive second-order achievability rate regions. Specifically, the channel noises are not necessarily Gaussian and we use spherical codebooks for both users. The weak…

In this paper, we characterize the stability region of the two-user broadcast channel. First, we obtain the stability region in the general case. Second, we consider the particular case where each receiver treats the interfering signal as…

We establish several new results on Marton's coding scheme and its corresponding inner bound on the capacity region of the general broadcast channel. We show that unlike the Gaussian case, Marton's coding scheme without superposition coding…

We characterize the capacity region of noiseless X-Channels with intermittent connectivity and delayed channel state information at the transmitters. We consider the general case in which each transmitter has a common message for both…

This paper considers the source coding problem with broadcast side information. The side information is sent to two receivers through a noisy broadcast channel. We provide an outer bound of the rate--distortion--bandwidth (RDB) quadruples…

We consider fundamental limits for communicating over a compound channel when the state of the channel needs to be masked. Our model is closely related to an area of study known as covert communication that is a setting in which the…

Finite blocklength and second-order (dispersion) results are presented for the arbitrarily-varying channel (AVC), a classical model wherein an adversary can transmit arbitrary signals into the channel. A novel finite blocklength…

We show that for any set of reals X there is a subset Y such X and Y have same Lebesgue outer measure and the distance between any two distinct points in Y is irrational.

One of the important unsolved problems in information theory is the conjecture that network coding has no rate benefit over routing in undirected unicast networks. Three known bounds on the symmetric rate in undirected unicast information…

We provide bounds for codes for a non-symmetric channel or, equivalently, for ternary codes with the Manhattan distance.