暂无分享,去创建一个
[1] Terence Chan,et al. Group characterizable entropy functions , 2007, 2007 IEEE International Symposium on Information Theory.
[2] Alex J. Grant,et al. The Minimal Set of Ingleton Inequalities , 2011, IEEE Transactions on Information Theory.
[3] R. Rado. Note on Independence Functions , 1957 .
[4] Ryan Kinser,et al. New inequalities for subspace arrangements , 2009, J. Comb. Theory, Ser. A.
[5] M. Lunelli,et al. Representation of matroids , 2002, math/0202294.
[6] Nikolai K. Vereshchagin,et al. Inequalities for Shannon Entropy and Kolmogorov Complexity , 1997, J. Comput. Syst. Sci..
[7] Raymond W. Yeung,et al. A First Course in Information Theory , 2002 .
[8] Randall Dougherty,et al. Networks, Matroids, and Non-Shannon Information Inequalities , 2007, IEEE Transactions on Information Theory.
[9] Randall Dougherty,et al. Insufficiency of linear coding in network information flow , 2005, IEEE Transactions on Information Theory.
[10] Dillon Mayhew,et al. On excluded minors for real-representability , 2009, J. Comb. Theory, Ser. B.
[11] Alex J. Grant,et al. Existence of new inequalities for representable polymatroids , 2009, 2010 IEEE International Symposium on Information Theory.
[12] Konstantin Makarychev,et al. Conditionally independent random variables , 2005, ArXiv.