Partitioning multi-dimensional sets in a small number of "uniform" parts

European Journal of Combinatorics

Volumn 28, Issue 1, 2007, Pages 134-144

  Alon, Noga ^a,b   Newman, Ilan ^c   Shen, Alexander ^d   Tardos, Gábor ^e   Vereshchagin, Nikolai ^f  

^a TEL AVIV UNIVERSITY   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

^c UNIVERSITY OF HAIFA   (Israel)

^d INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

^e ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

^f MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33749065367     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2005.08.002     Document Type: Article

References (4)

1. Makarychev K., Makarychev Yu., Romashchenko A., and Vereshchagin N. A new class of non Shannon type inequalities for entropies. Communications in Information and Systems 2 2 (2002) 147-166
2. Romashchenko A., Shen A., and Vereshchagin N. Combinatorial interpretation of Kolmogorov complexity. Theoretical Computer Science 271 (2002) 111-123
3. Chan T.H. A combinatorial approach to information inequalities. Communications in Information and Systems 1 3 (2001) 241-254
4. Yeung R.W., and Zhang Z. On characterization of entropy function via information inequalities. IEEE Transactions on Information Theory 44 July (1998) 1440-1450