The capacity region of multiple input erasure broadcast channels

In this paper, we look at the capacity region of a special class of broadcast channels with multiple inputs at the transmitter and a number of receivers. The channel between an input of the transmitter and a receiver is modelled as an independent memoryless erasure channel. We assume that the signals coming from different inputs to the receiver do not interfere with each other. Also for each input, the transmitter sends the same signal through the channels outgoing from that input. This class of broadcast channels does not necessarily belong to the class of "more capable". We show that the capacity region of these broadcast channels is achieved by time-sharing between the receivers at each input. Finally, the implications of these results to the more general network setup are discussed

[1]  Shlomo Shamai,et al.  The capacity region of the Gaussian MIMO broadcast channel , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[2]  Patrick P. Bergmans,et al.  Random coding theorem for broadcast channels with degraded components , 1973, IEEE Trans. Inf. Theory.

[3]  Tracey Ho,et al.  Linear Network Codes: A Unified Framework for Source, Channel, and Network Coding , 2003, Advances in Network Information Theory.

[4]  Thomas M. Cover,et al.  Comments on Broadcast Channels , 1998, IEEE Trans. Inf. Theory.

[5]  Abbas El Gamal,et al.  The capacity of a class of broadcast channels , 1979, IEEE Trans. Inf. Theory.

[6]  Madhu Sudan,et al.  Priority encoding transmission , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.