Evaluation of Marton's Inner Bound for the General Broadcast Channel

The best known inner bound on the two-receiver general broadcast channel is due to Marton. However this region is not computable (except in certain special cases) as no bounds on the cardinality of its auxiliary random variables exist. Nor is it even clear that the inner bound is a closed set. The main obstacle in proving cardinality bounds is the fact that the traditional use of the Carathéodory theorem, the main known tool for proving cardinality bounds, does not yield a finite cardinality result. One of the main contributions of this paper is the introduction of a new tool based on an identity that relates the second derivative of the Shannon entropy of a discrete random variable (under a certain perturbation) to the corresponding Fisher information. In order to go beyond the traditional Carathéodory type arguments, we identify certain properties that the auxiliary random variables corresponding to the extreme points of the inner bound need to satisfy. These properties are then used to establish cardinality bounds on the auxiliary random variables of the inner bound, thereby proving the computability of the region, and its closedness. Lastly, we establish a conjecture of Nair and Zizhou that Marton's inner bound and the recent outer bound of Nair and El Gamal do not match in general.

[1]  Amin Gohari,et al.  Evaluation of Marton's inner bound for the general broadcast channel , 2009, ISIT.

[2]  Amin Gohari,et al.  On Marton ’ s inner bound for two receiver broadcast channels , 2011 .

[3]  H. Vincent Poor,et al.  Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution , 2007, IEEE Transactions on Information Theory.

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

[5]  Chandra Nair,et al.  The capacity region for two classes of product broadcast channels , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[6]  Edward C. van der Meulen,et al.  Random coding theorems for the general discrete memoryless broadcast channel , 1975, IEEE Trans. Inf. Theory.

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

[8]  Chandra Nair,et al.  An Information Inequality and Evaluation of Marton's Inner Bound for Binary Input Broadcast Channels , 2013, IEEE Trans. Inf. Theory.

[9]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[10]  Shlomo Shamai,et al.  The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel , 2006, IEEE Transactions on Information Theory.

[11]  V. Anantharam,et al.  An outer bound to the admissible source region of broadcast channels with arbitrarily correlated sources and channel variations , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

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

[13]  Varun Jog,et al.  An information inequality for the BSSC channel , 2009 .

[14]  F. Willems.  The maximal-error and average-error capacity region of the broadcast channel are identical : A direct proof , 1990 .

[15]  Thomas M. Cover,et al.  An achievable rate region for the broadcast channel , 1975, IEEE Trans. Inf. Theory.

[16]  Venkat Anantharam,et al.  On an outer bound and an inner bound for the general broadcast channel , 2010, 2010 IEEE International Symposium on Information Theory.

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

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

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

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

[21]  János Körner,et al.  General broadcast channels with degraded message sets , 1977, IEEE Trans. Inf. Theory.

[22]  Bruce E. Hajek,et al.  Evaluation of an achievable rate region for the broadcast channel , 1979, IEEE Trans. Inf. Theory.

[23]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[24]  Chandra Nair.  A note on outer bounds for broadcast channel , 2011, ArXiv.

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

[26]  DRAFT. April , 2004 .

[27]  Yingbin Liang,et al.  Equivalence of two inner bounds on the capacity region of the broadcast channel , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.