A block Markov encoding scheme for broadcasting nested message sets

Encoding schemes for broadcasting two nested message sets are studied. We start with a simple class of deterministic broadcast channels for which (variants of) linear superposition coding are optimal in several cases [1], [2]. Such schemes are sub-optimal in general, and we propose a block Markov encoding scheme which achieves (for some deterministic channels) rates not achievable by the previous schemes in [1], [2]. We adapt this block Markov encoding scheme to general broadcast channels, and show that it achieves a rate-region which includes the previously known rate-regions1.

[1]  Vinod M. Prabhakaran,et al.  Broadcasting Nested Message Sets , 2012 .

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

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

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

[5]  Raymond W. Yeung,et al.  Network coding gain of combination networks , 2004, Information Theory Workshop.

[6]  Thomas M. Cover,et al.  Network Information Theory , 2001 .

[7]  Suhas N. Diggavi,et al.  On multicasting nested message sets over combination networks , 2012, 2012 IEEE Information Theory Workshop.

[8]  S. Diggavi,et al.  Broadcasting with Degraded Message Sets : A Deterministic Approach , 2007 .

[9]  Christina Fragouli,et al.  On degraded two message set broadcasting , 2009, 2009 IEEE Information Theory Workshop.

[10]  Thomas M. Cover,et al.  Broadcast channels , 1972, IEEE Trans. Inf. Theory.

[11]  Frans M. J. Willems,et al.  The discrete memoryless multiple-access channel with cribbing encoders , 1985, IEEE Trans. Inf. Theory.

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