On the Evaluation of Marton’s Inner Bound for Two-Receiver Broadcast Channels

Marton’s inner bound is the best known achievable rate region for a general two-receiver discrete memoryless broadcast channel. In this paper, we establish improved bounds on the cardinalities of the auxiliary random variables appearing in this inner bound to the true rate region. We combine a perturbation technique, along with a representation using concave envelopes of information-theoretic functions that involve the use of auxiliary random variables, to achieve this improvement. The new cardinality bounds lead to a proof that a randomized-time-division strategy achieves every rate triple in Marton’s region for binary input broadcast channels. This extends the result by Hajek and Pursley which showed that the Cover-van der Muelen region was exhausted by the randomized-time-division strategy.

[1]  R. Tyrrell Rockafellar,et al.  Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.

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

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

[4]  Frode Terkelsen,et al.  Some Minimax Theorems. , 1972 .

[5]  Chandra Nair,et al.  On Marton's Inner Bound and Its Optimality for Classes of Product Broadcast Channels , 2014, IEEE Transactions on Information Theory.

[6]  Venkat Anantharam,et al.  On Marton's inner bound for broadcast channels , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[7]  A. Sridharan.  Broadcast Channels , 2022 .

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

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

[10]  Venkat Anantharam,et al.  On Marton’s Inner Bound for the General Broadcast Channel , 2014, IEEE Transactions on Information Theory.

[11]  Chandra Nair,et al.  Upper concave envelopes and auxiliary random variables , 2013 .

[12]  Chandra Nair,et al.  The Capacity Region of the Two-Receiver Gaussian Vector Broadcast Channel With Private and Common Messages , 2014, IEEE Transactions on Information Theory.

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

[14]  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.

[15]  Chandra Nair,et al.  Capacity regions of two new classes of 2-receiver broadcast channels , 2009, 2009 IEEE International Symposium on Information Theory.

[16]  Chandra Nair,et al.  Sub-optimality of Han-Kobayashi achievable region for interference channels , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[17]  Abbas El Gamal,et al.  Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).

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