Degraded two-message multicast over graphs

We consider communication of two degraded message sets over graphs where a common source sends two prioritized messages (a common and a private message) to several receivers. All receivers require the common message and a subset of the receivers require both the common and private messages. In this paper, we consider the case where all but two of the receivers require both messages. We provide an outer-bound on the rate region that depends on graph properties. We prove that this bound is achievable by using carefully selected linear operations at the network nodes. The achievability proof is built on our result in [14] and is illustrating potential connections of communication over deterministic channels and communication over graphs.

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

[2]  Tracey Ho,et al.  Online incremental network coding for multiple unicasts , 2005 .

[3]  Christina Fragouli,et al.  Network Coding Applications , 2008, Found. Trends Netw..

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

[5]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

[6]  Serap A. Savari,et al.  Edge-Cut Bounds on Network Coding Rates , 2006, Journal of Network and Systems Management.

[7]  Jehoshua Bruck,et al.  Network coding for non-uniform demands , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

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

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

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

[11]  Christina Fragouli,et al.  Degraded Multicasting with Network Coding over the Combination Network , 2011, 2011 International Symposium on Networking Coding.

[12]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[13]  Robert D. Kleinberg,et al.  On the capacity of information networks , 2006, IEEE Transactions on Information Theory.

[14]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[15]  Christina Fragouli,et al.  On Achievable Information Rates in Single-Source Non-Uniform Demand Networks , 2006, 2006 IEEE International Symposium on Information Theory.

[16]  Baochun Li,et al.  Network Coding : The Case of Multiple Unicast Sessions , 2004 .

[17]  T. Ho,et al.  On Linear Network Coding , 2010 .

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