On group network codes: Ingleton-bound violations and independent sources
暂无分享,去创建一个
[1] Zhen Zhang,et al. The Capacity Region for Multi-source Multi-sink Network Coding , 2007, 2007 IEEE International Symposium on Information Theory.
[2] Babak Hassibi,et al. Violating the Ingleton inequality with finite groups , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[3] M. Lunelli,et al. Representation of matroids , 2002, math/0202294.
[4] Babak Hassibi,et al. Normalized Entropy Vectors, Network Information Theory and Convex Optimization , 2007, 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks.
[5] Raymond W. Yeung,et al. On a relation between information inequalities and group theory , 2002, IEEE Trans. Inf. Theory.
[6] Randall Dougherty,et al. Insufficiency of linear coding in network information flow , 2005, IEEE Transactions on Information Theory.
[7] Terence Chan,et al. Group characterizable entropy functions , 2007, 2007 IEEE International Symposium on Information Theory.
[8] Terence Chan. On the optimality of group network codes , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..
[9] T. Chan,et al. Capacity regions for linear and abelian network codes , 2007, 2007 Information Theory and Applications Workshop.