The Vámos Network

The well-studied Vámos matroid has provided a wealth of interesting theoretical results in matroid theory. We use the Vámos matroid to construct a new network, which we call the Vámos network. We then exploit the Vámos network to answer in the negative the open question as to whether Shannon-type information inequalities are in general sufficient for computing network coding capacities. To accomplish this, we first determine the smallest coding capacity upper bound that can be obtained for the Vámos network using only Shannon-type information inequalities. Then, we prove that a smaller capacity upper bound for the Vámos network can be obtained by using a non-Shannon type information inequality discovered in 1998 by Zhang and Yeung. This is the first published application of a non-Shannon-type inequality to network coding. Finally, we demonstrate that one can compute the exact routing capacity and linear coding capacity of the Vámos network.

[1]  Radim Lněnička,et al.  On the tightness of the Zhang-Yeung inequality for Gaussian vectors , 2003, Commun. Inf. Syst..

[2]  Nikolai K. Vereshchagin,et al.  Inequalities for Shannon entropies and Kolmogorov complexities , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

[3]  Robert D. Kleinberg,et al.  On the capacity of information networks , 2006, SODA 2006.

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

[5]  Otto F. G. Schilling,et al.  Basic Abstract Algebra , 1975 .

[6]  Zhen Zhang,et al.  On a new non-Shannon-type information inequality , 2002, Proceedings IEEE International Symposium on Information Theory,.

[7]  James G. Oxley,et al.  Matroid theory , 1992 .

[8]  Randall Dougherty,et al.  Unachievability of network coding capacity , 2006, IEEE Transactions on Information Theory.

[9]  Nikolai K. Vereshchagin,et al.  A new class of non-Shannon-type inequalities for entropies , 2002, Commun. Inf. Syst..

[10]  April Rasala Lehman,et al.  Complexity classification of network information flow problems , 2004, SODA '04.

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

[12]  Randall Dougherty,et al.  Network routing capacity , 2005, IEEE Transactions on Information Theory.

[13]  Zongpeng Li,et al.  Network Coding in Undirected Networks , 2004 .

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

[15]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[16]  Robert D. Kleinberg,et al.  Comparing Network Coding with Multicommodity Flow for the k-pairs Communication Problem , 2004 .

[17]  Zhen Zhang,et al.  On Characterization of Entropy Function via Information Inequalities , 1998, IEEE Trans. Inf. Theory.

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

[19]  Sae-Young Chung,et al.  Network coding , 2008, Journal of Communications and Networks.