The Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC) is considered. The dirty-paper coding (DPC) rate region is shown to coincide with the capacity region. To that end, a new notion of an enhanced broadcast channel is introduced and is used jointly with the entropy power

We define and study capacity regions for wireless ad hoc networks with an arbitrary number of nodes and topology. These regions describe the set of achievable rate combinations between all source-destination pairs in the network under various transmission strategies, such as variable

The key ideas in the theory of broadcast channels are illustrated by discussing some of the progress toward finding the capacity region. The capacity region is still unknown. Index Terms---Binning, broadcast channel, capacity, degraded broadcast channel, feedback capacity, Slepian

A new inner bound on the capacity region of the general index coding problem is established. Unlike most existing bounds that are based on graph theoretic or algebraic tools, the bound relies on a random coding scheme and optimal decoding, and has a simple polymatroidal single-letter expression

timely manner. The key contributions of this paper are: We propose a novel way to represent the capacity region of a set of stations sharing the wireless medium, which we refer to as linearized capacity region, and compute the corresponding ⇑ Corresponding author.

timely manner. The key contributions of this paper are: We propose a novel way to represent the capacity region of a set of stations sharing the wireless medium, which we refer to as linearized capacity region, and compute the corresponding ⇑ Corresponding author.

Abstract—The capacity of the two-user Gaussian interference channel has been open for 30 years. The understanding on this problem has been limited. The best known achievable region is due to Han and Kobayashi but its characterization is very complicated. It is also not known how tight the existing

network model that captures the key practical aspects of such systems and characterize the constraints binding their behavior. We provide necessary conditions to verify the feasibility of rate vectors in these networks, and use them to derive upper bounds on the capacity in terms of achievable throughput

Abstract—We study a class of discrete memoryless Z channels, where there are some deterministic components in the channel configuration. We call this channel the semi-deterministic Z channel. We first provide an outer bound on the capacity region. Then the known achievable rate region

. We obtain the entire capacity region of this channel. We also explore the connections between the capacity region we obtain for the Gaussian MIMO broadcast channel with common and confidential messages and the capacity region of its non-confidential counterpart, i.e., the Gaussian MIMO broadcast