The Single Source Two Terminal Network with Network Coding

We consider a communication network with a single source that has a set of messages and two terminals where each terminal is interested in an arbitrary subset of messages at the source. A tight capacity region for this problem is demonstrated. We show by a simple graph-theoretic procedure that any such problem can be solved by performing network coding on the subset of messages that are requested by both the terminals and that routing is sufficient for transferring the remaining messages.

[1]  C. K. Ngai,et al.  Multisource network coding with two sinks , 2004, 2004 International Conference on Communications, Circuits and Systems (IEEE Cat. No.04EX914).

[2]  Minkyu Kim,et al.  Linear Network Codes : A Unified Framework for Source , Channel , and Network Coding , 2003 .

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

[4]  Peter Sanders,et al.  Polynomial time algorithms for multicast network code construction , 2005, IEEE Transactions on Information Theory.

[5]  Tracey Ho,et al.  Toward a Random Operation of Networks , 2004 .

[6]  Aditya Ramamoorthy,et al.  Separating distributed source coding from network coding , 2006, IEEE Transactions on Information Theory.

[7]  Randall Dougherty,et al.  Insufficiency of linear coding in network information flow , 2005, IEEE Transactions on Information Theory.

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

[9]  R. Koetter,et al.  Network Coding for Correlated Sources , 2004 .

[10]  Mohammad R. Salavatipour,et al.  Packing Steiner trees , 2003, SODA '03.

[11]  Muriel Médard,et al.  Beyond routing: an algebraic approach to network coding , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[12]  Tracey Ho,et al.  Linear Network Codes: A Unified Framework for Source, Channel, and Network Coding , 2003, Advances in Network Information Theory.

[13]  Richard M. Wilson,et al.  A course in combinatorics , 1992 .