Non-entropic inequalities from information constraints

This paper investigates a new method in proving converses in secure communication problems. The method gives a converse result in terms of the logarithm of support size instead of entropy. The results are connected to constrained information inequalities involving three random variables. A new constrained non-Shannon type inequality is shown.

[1]  Sergio Verdú,et al.  On the Interplay Between Conditional Entropy and Error Probability , 2010, IEEE Transactions on Information Theory.

[2]  Sergio Verdú,et al.  Generalizing the Fano inequality , 1994, IEEE Trans. Inf. Theory.

[3]  I. Olkin,et al.  Inequalities: Theory of Majorization and Its Applications , 1980 .

[4]  Frantisek Matús,et al.  Infinitely Many Information Inequalities , 2007, 2007 IEEE International Symposium on Information Theory.

[5]  Raymond W. Yeung,et al.  Information Theory and Network Coding , 2008 .

[6]  Frantisek Matús,et al.  Piecewise linear conditional information inequality , 2006, IEEE Transactions on Information Theory.

[7]  Yijie Xiong,et al.  Measurement of enterprise management efficiency based upon information entropy and evidence theory , 2010 .

[8]  Siu-Wai Ho,et al.  Error-free perfect-secrecy systems , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[9]  Alex J. Grant,et al.  Non-linear Information Inequalities , 2008, Entropy.

[10]  Terence Chan.  Recent Progresses in Characterising Information Inequalities , 2011, Entropy.