MCMC methods for entropy optimization and nonlinear network coding

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2010, Pages 2383-2387

  Shadbakht, Sormeh ^a   Hassibi, Babak ^a  

^a California Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENTROPY OPTIMIZATION; LARGE CLASS; MCMC METHOD; MONTE CARLO MARKOV CHAIN; NETWORK INFORMATION THEORY; RANDOM WALK; TRUTH TABLES; UNIFORM DISTRIBUTION;

ENCODING (SYMBOLS); ENTROPY; HIDDEN MARKOV MODELS; INFORMATION THEORY; MONTE CARLO METHODS; NONLINEAR NETWORKS; OPTIMIZATION; STOCHASTIC MODELS; VECTOR SPACES;

RANDOM VARIABLES;

EID: 77955689222     PISSN: 21578103     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2010.5513737     Document Type: Conference Paper

References (8)

1. D. Cullina, A. Dimakis, and T. Ho, "Searching for minimum storage regenerating codes," arXiv:0910.2245v.
2. X. Yan, R. W. Yeung, and Z. Zhang, "The capacity region for multi-source multi-sink network coding," in IEEE Int'l. Symp. Inf. Theory (ISIT), 2007.
3. B. Hassibi and S. Shadbakht, "Normalized entropy vectors, network information theory and convex optimization," in Inf. Theory Workshop, Bergen, Norway, 2007.
4. T. H. Chan, "A combinatorial approach to information inequalities," Comm. in Inf. and Sys., vol. 1, no. 3, pp. 241-254, 2001.
5. T. H. Chan and R. W. Yeung, "On a relation between information inequalities and group theory," IEEE Tran. on Inf. Theory, vol. 48, no. 7, pp. 1992-1995, 2002.
6. Z. Zhang and R. Yeung, "On characterization of entropy function via information inequalities," IEEE Trans. on Inf. Theory, vol. 44, no. 4, pp. 1440-1452, 1998.
7. W. Mao and B. Hassibi, "Violating the Ingleton inequality with finite groups," 46th Allerton Conf. on Comm., Control, and Comp., 2009.
8. R. Dougherty, C. Freiling, and K. Zeger, "The Vamos network," NETCOD, 2006.