MCMC methods for entropy optimization and nonlinear network coding
暂无分享,去创建一个
[1] Babak Hassibi,et al. Violating the Ingleton inequality with finite groups , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[2] Zhen Zhang,et al. On Characterization of Entropy Function via Information Inequalities , 1998, IEEE Trans. Inf. Theory.
[3] Zhen Zhang,et al. The Capacity Region for Multi-source Multi-sink Network Coding , 2007, 2007 IEEE International Symposium on Information Theory.
[4] Ho-Leung Chan,et al. A combinatorial approach to information inequalities , 1999, 1999 Information Theory and Networking Workshop (Cat. No.99EX371).
[5] R. Dougherty,et al. The Vámos Network , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.
[6] 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.
[7] Raymond W. Yeung,et al. On a relation between information inequalities and group theory , 2002, IEEE Trans. Inf. Theory.
[8] Alexandros G. Dimakis,et al. Searching for Minimum Storage Regenerating Codes , 2009, ArXiv.
[9] Kenneth Zeger,et al. The Vámos Network , 2005 .