An outer bound to the admissible source region of broadcast channels with arbitrarily correlated sources and channel variations

In this paper we apply the ldquopotential function methodrdquo introduced by the authors in [5] and [6] to prove an outer bound on the admissible source region of an arbitrarily varying general broadcast channel with arbitrarily correlated sources. We are not aware of any previous work discussing any interesting outer bounds on the admissible source region of the general broadcast channel either when the sources are allowed to be arbitrarily correlated, the channel is allowed to vary arbitrarily, or both. Specializing by removing the variability of the channel and assuming independent sources, our outer bound reduces to one that is included inside the region defined by Liang, Kramer and Shamai, a recent outer bound on the capacity region of the traditional broadcast channel [12]. We don't know if the inclusion is strict. The arbitrarily varying channel aspect of our bound is rather superficial; the main interest is in the arbitrarily correlated source part.

[1]  Hiroshi Sato,et al.  An outer bound to the capacity region of broadcast channels (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[2]  Katalin Marton,et al.  A coding theorem for the discrete memoryless broadcast channel , 1979, IEEE Trans. Inf. Theory.

[3]  Johann-Heinrich Jahn,et al.  Coding of arbitrarily varying multiuser channels , 1981, IEEE Trans. Inf. Theory.

[4]  Max H. M. Costa,et al.  Broadcast channels with arbitrarily correlated sources , 1987, IEEE Trans. Inf. Theory.

[5]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[6]  Abbas El Gamal,et al.  An outer bound to the capacity region of the broadcast channel , 2006, ISIT.

[7]  Shraga I. Bross,et al.  On the Deterministic-Code Capacity of the Two-User Discrete Memoryless Arbitrarily Varying General Broadcast Channel With Degraded Message Sets , 2006, IEEE Transactions on Information Theory.

[8]  E. Hof,et al.  On the Deterministic-Code Capacity of the Two-User Discrete Memoryless Arbitrarily Varying General Broadcast Channel with Degraded Message Sets , 2006, 2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel.

[9]  Yingbin Liang,et al.  Rate Regions for Relay Broadcast Channels , 2006, IEEE Transactions on Information Theory.

[10]  Chandra Nair An outer bound for 2-receiver discrete memoryless broadcast channels , 2008, ArXiv.

[11]  Shlomo Shamai,et al.  Capacity outer bounds for broadcast channels , 2008, 2008 IEEE Information Theory Workshop.

[12]  Chandra Nair,et al.  On the inner and outer bounds for 2-receiver discrete memoryless broadcast channels , 2008, 2008 Information Theory and Applications Workshop.

[13]  Venkat Anantharam,et al.  Information-Theoretic Key Agreement of Multiple Terminals—Part I , 2010, IEEE Transactions on Information Theory.

[14]  Venkat Anantharam,et al.  Information-Theoretic Key Agreement of Multiple Terminals—Part II: Channel Model , 2010, IEEE Transactions on Information Theory.