| The random-code capacity region of the multiple-access arbitrarily varying channel subject to both state and input constraints is determined. Consideration of a simple erasure channel shows that the capacity region is not convex in general.

The model of communication is as follows (see Fig. 1). Each user i chooses a label mi uniformly from its message set [Mi] and sends the codeword ei(mi). All the users send their codewords simultaneously, symbol by symbol. After n transmissions, a sequence of n output symbols (y1, y2, . . . , yn) is received according to the transition probability matrix. This is then decoded by the decoding fun...

We formulate and study a cryptographic problem relevant to wireless: a sender, Alice, wants to transmit private messages to two receivers, Bob and Calvin, using unreliable wireless broadcast transmissions and short public feedback from Bob and Calvin. We ask, at what rates can we broadcast the private messages if we also provide (information-theoretic) unconditional security guarantees that Bob...

This paper adds to the understanding of the capacity region of the Gaussian interference channel. To this end, the capacity region of the one-sided Gaussian interference channel is first fully characterized. This is accomplished by introducing a new representation of the Han-Kobayashi region and providing a new outer bound on the capacity region of this channel which is tight both in the weak a...

In this paper, we study a new bus communication model, where two transmitters wish to send their corresponding private messages and a common message to a destination, while they also wish to send the common message to another receiver connected to the same wire. From an information-theoretical point of view, we first study a general case of this new model (with discrete memoryless channels). Th...

An approximate capacity region is established of a class of interfering multiple access channels consisting of two multiple-access channels (MACs), each with an arbitrary number of users, with interference from one of the transmitters of one MAC to the receiver of the other MAC, which we refer to henceforth as the MAC-IC-MAC. It is shown that, for the semi-deterministic MAC-IC-MAC, single-user ...

In this paper, we consider a special class of wireless networks, called wireless erasure networks. In these networks, each node is connected to a set of nodes by independent erasure channels. The network model incorporates the broadcast nature of the wireless environment in that each node sends out the same signal on its outgoing channels. However, we assume there is no interference in receptio...

The capacity regions are investigated for two relay broadcast channels (RBCs), where relay links are incorporated into standard two-user broadcast channels to support user cooperation. In the first channel, the Partially Cooperative Relay Broadcast Channel, only one user in the system can act as a relay and transmit to the other user through a relay link. An achievable rate region is derived ba...

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.

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.