A construction method of matroidal networks

This paper discusses the question whether a network-matroid construction can be modified so that all matroid dependencies are reflected in the network. We propose a novel construction method for a matroidal network to address this issue. Furthermore, we investigate some properties of the matroidal network based on our construction method. New relations between the matroidal network and its associated matroid are developed through various examples.

[1]  Haibin Kan,et al.  A characterization of solvability for a class of networks , 2011, Science China Information Sciences.

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

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

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

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

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

[7]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[8]  Randall Dougherty,et al.  Networks, Matroids, and Non-Shannon Information Inequalities , 2007, IEEE Transactions on Information Theory.

[9]  R. Yeung,et al.  On characterization of entropy function via information inequalities , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).