2000 character limit reached
On the Non-robustness of Essentially Conditional Information Inequalities (1207.5458v1)
Published 23 Jul 2012 in cs.IT, math.IT, and math.PR
Abstract: We show that two essentially conditional linear inequalities for Shannon's entropies (including the Zhang-Yeung'97 conditional inequality) do not hold for asymptotically entropic points. This means that these inequalities are non-robust in a very strong sense. This result raises the question of the meaning of these inequalities and the validity of their use in practice-oriented applications.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.