Broadcasting with Degraded Message Sets : A Deterministic Approach

In this paper we study the nested (degraded) message set problem, where user i ∈ {1, . . . , K} requires messages W1, . . . , Wi. We study this for a MIMO linear deterministic broadcast channel model, which is motivated by some recent successes in using such models to obtain insights into approximate characterizations for the Gaussian relay and interference channels. We establish the complete solution for the K = 3 user nested message problem for the MIMO linear deterministic broadcast channel. We also establish some extremal points for the general K-user case, where there are only two messages of interest.

[1]  Patrick P. Bergmans,et al.  A simple converse for broadcast channels with additive white Gaussian noise (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[2]  Robert G. Gallager,et al.  Capacity and coding for degraded broadcast channels , 1974 .

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

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

[5]  Te Sun Han.  The capacity region for the deterministic broadcast channel with a common message , 1981, IEEE Trans. Inf. Theory.

[6]  Shlomo Shamai,et al.  A broadcast strategy for the Gaussian slowly fading channel , 1997, Proceedings of IEEE International Symposium on Information Theory.

[7]  Prakash Narayan,et al.  Reliable Communication Under Channel Uncertainty , 1998, IEEE Trans. Inf. Theory.

[8]  Lizhong Zheng,et al.  Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels , 2003, IEEE Trans. Inf. Theory.

[9]  Suhas N. Diggavi,et al.  Diversity Embedding in Multiple Antenna Communications , 2003, Advances in Network Information Theory.

[10]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

[11]  Suhas N. Diggavi,et al.  Fundamental limits of diversity-embedded codes over fading channels , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[12]  Suhas N. Diggavi,et al.  On opportunistic codes and broadcast codes with degraded message sets , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Punta del Este.

[13]  Shlomo Shamai,et al.  On the Capacity Region of the Multi-Antenna Broadcast Channel with Common Messages , 2006, 2006 IEEE International Symposium on Information Theory.

[14]  R. Yeung,et al.  Network coding theory , 2006 .

[15]  Suhas N. Diggavi,et al.  Wireless Network Information Flow , 2007, ArXiv.

[16]  Hua Wang,et al.  Gaussian Interference Channel Capacity to Within One Bit , 2007, IEEE Transactions on Information Theory.

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