A combinatorial approach to information inequalities

The authors present theorems that lead to a new combinatorial approach to prove information inequality. The non-negativity of Shannon's information measures can all be derived using this combinatorial approach, and each of these inequalities has a very simple intuitive combinatorial explanation.

[1]  Raymond W. Yeung,et al.  A framework for linear information inequalities , 1997, IEEE Trans. Inf. Theory.

[2]  Tsutomu Kawabata,et al.  The structure of the I-measure of a Markov chain , 1992, IEEE Trans. Inf. Theory.

[3]  Zhen Zhang,et al.  A non-Shannon-type conditional inequality of information quantities , 1997, IEEE Trans. Inf. Theory.

[4]  Raymond W. Yeung,et al.  A new outlook of Shannon's information measures , 1991, IEEE Trans. Inf. Theory.