On The Three-Receiver Multilevel Broadcast Channel with Random Parameters

In this paper we extend the analysis of tworeceiver broadcast channels with random parameters to the three-receivers case. Specifically we base our work on Nair and El Gamal's results for the three-receiver discrete memoryless multilevel broadcast channel and assume that state information is available non-causally at the transmitter.We provide an achievable rate region for this setting and acknowledge its importance in the study of multiuser cognitive radio configurations

Lecture Notes on Network Information Theory

These lecture notes have been converted to a book titled Network Information Theory published recently by Cambridge University Press. This book provides a significantly expanded exposition of the material in the lecture notes as well as problems and bibliographic notes at the end of each chapter. The authors are currently preparing a set of slides based on the book that will be posted in the second half of 2012. More information about the book can be found at http://www.cambridge.org/9781107008731/. The previous (and obsolete) version of the lecture notes can be found at http://arxiv.org/abs/1001.3404v4/

Broadcast Channels with Cooperating Decoders

We consider the problem of communicating over the general discrete memoryless broadcast channel (BC) with partially cooperating receivers. In our setup, receivers are able to exchange messages over noiseless conference links of finite capacities, prior to decoding the messages sent from the transmitter. In this paper we formulate the general problem of broadcast with cooperation. We first find the capacity region for the case where the BC is physically degraded. Then, we give achievability results for the general broadcast channel, for both the two independent messages case and the single common message case.Comment: Final version, to appear in the IEEE Transactions on Information Theory -- contains (very) minor changes based on the last round of review