Polymatroids with network coding

The problem of network coding for multicasting a single source to multiple sinks has first been studied by Ahlswede, Cai, Li and Yeung in 2000, in which they have established the celebrated max-flow mini-cut theorem on non-physical information flow over a network of independent channels. On the other hand, in 1980, Han has studied the case with correlated multiple sources and a single sink from the viewpoint of polymatroidal functions in which a necessary and sufficient condition has been demonstrated for reliable transmission over the network. This paper presents an attempt to unify both cases, which leads to establish a necessary and sufficient condition for reliable transmission over a noisy network for multicasting all the correlated multiple sources to all the multiple sinks. Furthermore, we address also the problem of transmitting “independent” sources over a multiple-access-type of network as well as over a broadcast-type of network, which reveals that the (co-) polymatroidal structures are intrinsically involved in these types of network coding.

[1]  João Barros,et al.  Network information flow with correlated sources , 2005, IEEE Transactions on Information Theory.

[2]  R. Gallager.  Information Theory and Reliable Communication , 1968 .

[3]  Zhen Zhang,et al.  An outer bound for multisource multisink network coding with minimum cost consideration , 2006, TNET.

[4]  Thomas M. Cover,et al.  A Proof of the Data Compression Theorem of Slepian and Wolf for Ergodic Sources , 1971 .

[5]  Gerhard Kramer,et al.  The multicast capacity of deterministic relay networks with no interference , 2006, IEEE Transactions on Information Theory.

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

[7]  Zhen Zhang,et al.  The Capacity Region for Multi-source Multi-sink Network Coding , 2007, 2007 IEEE International Symposium on Information Theory.

[8]  Lihua Song,et al.  A separation theorem for single-source network coding , 2006, IEEE Transactions on Information Theory.

[9]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[10]  Te Sun Han.  Multicasting correlated multi-source to multi-sink over a network , 2009 .

[11]  Sergio Verdú,et al.  A general formula for channel capacity , 1994, IEEE Trans. Inf. Theory.

[12]  Hiroki Koga,et al.  Information-Spectrum Methods in Information Theory , 2002 .

[13]  Lihua Song,et al.  Zero-error network coding for acyclic network , 2003, IEEE Trans. Inf. Theory.

[14]  Dinkar Vasudevan,et al.  Broadcast and slepian-wolf multicast over Aref networks , 2008, 2008 IEEE International Symposium on Information Theory.

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

[16]  János Körner,et al.  How to encode the modulo-two sum of binary sources (Corresp.) , 1979, IEEE Trans. Inf. Theory.

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

[18]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[19]  Imre Csiszár.  Linear codes for sources and source networks: Error exponents, universal coding , 1982, IEEE Trans. Inf. Theory.

[20]  Te Sun Han,et al.  Slepian-Wolf-Cover Theorem for Networks of Channels , 1980, Inf. Control..

[21]  Aditya Ramamoorthy,et al.  Minimum Cost Distributed Source Coding Over a Network , 2007, IEEE Transactions on Information Theory.

[22]  Muriel Médard,et al.  Minimum-Cost Subgraphs for Joint Distributed Source and Network Coding , 2006 .

[23]  R. Koetter,et al.  An algebraic approach to network coding , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[24]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.

[25]  Raymond W. Yeung,et al.  A First Course in Information Theory , 2002 .

[26]  Nimrod Megiddo,et al.  Optimal flows in networks with multiple sources and sinks , 1974, Math. Program..

[27]  Toby Berger,et al.  Successive Coding in Multiuser Information Theory , 2007, IEEE Transactions on Information Theory.

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

[29]  R. Yeung,et al.  Network information flow-multiple sources , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).