English
Related papers

Related papers: On essentially conditional information inequalitie…

200 papers

We study conditional linear information inequalities, i.e., linear inequalities for Shannon entropy that hold for distributions whose entropies meet some linear constraints. We prove that some conditional information inequalities cannot be…

Information Theory · Computer Science 2013-10-30 Tarik Kaced , Andrei Romashchenko

Any unconstrained information inequality in three or fewer random variables can be written as a linear combination of instances of Shannon's inequality I(A;B|C) >= 0 . Such inequalities are sometimes referred to as "Shannon" inequalities.…

Information Theory · Computer Science 2011-04-20 Randall Dougherty , Chris Freiling , Kenneth Zeger

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…

Information Theory · Computer Science 2012-07-24 Tarik Kaced , Andrei Romashchenko

In 1998, Zhang and Yeung found the first unconditional non-Shannon-type information inequality. Recently, Dougherty, Freiling and Zeger gave six new unconditional non-Shannon-type information inequalities. This work generalizes their work…

Information Theory · Computer Science 2008-05-01 Weidong Xu , Jia Wang , Jun Sun

In the past over two decades, very fruitful results have been obtained in information theory in the study of the Shannon entropy. This study has led to the discovery of a new class of constraints on the Shannon entropy called…

Information Theory · Computer Science 2025-03-07 Raymond W. Yeung

Information inequalities govern the ultimate limitations in information theory and as such play an pivotal role in characterizing what values the entropy of multipartite states can take. Proving an information inequality, however, quickly…

Quantum Physics · Physics 2025-10-23 Shao-Lun Huang , Tobias Rippchen , Mario Berta

The paper deals with conditional linear information inequalities valid for entropy functions induced by discrete random variables. Specifically, the so-called conditional Ingleton inequalities are in the center of interest: these are valid…

Information Theory · Computer Science 2022-03-16 Milan Studeny

There is a parallelism between Shannon information theory and algorithmic information theory. In particular, the same linear inequalities are true for Shannon entropies of tuples of random variables and Kolmogorov complexities of tuples of…

Information Theory · Computer Science 2022-09-12 Bruno Bauwens , Peter Gács , Andrei Romashchenko , Alexander Shen

Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities generalize Shannon's chain rule for entropy as well as…

Information Theory · Computer Science 2024-05-07 Mokshay Madiman , Prasad Tetali

A causal structure is a relationship between observed variables that in general restricts the possible correlations between them. This relationship can be mediated by unobserved systems, modelled by random variables in the classical case or…

Quantum Physics · Physics 2018-03-15 Mirjam Weilenmann , Roger Colbeck

The entropic region is formed by the collection of the Shannon entropies of all subvectors of finitely many jointly distributed discrete random variables. For four or more variables, the structure of the entropic region is mostly unknown.…

Information Theory · Computer Science 2026-03-04 E. P. Csirmaz , L. Csirmaz

There are numerous characterizations of Shannon entropy and Tsallis entropy as measures of information obeying certain properties. Using work by Faddeev and Furuichi, we derive a very simple characterization. Instead of focusing on the…

Information Theory · Computer Science 2017-08-22 John C. Baez , Tobias Fritz , Tom Leinster

We exhibit infinitely many new, constrained inequalities for the von Neumann entropy, and show that they are independent of each other and the known inequalities obeyed by the von Neumann entropy (basically strong subadditivity). The new…

Quantum Physics · Physics 2012-10-30 Josh Cadney , Noah Linden , Andreas Winter

We provide a condition under which a version of Shannon's Entropy Power Inequality will hold for dependent variables. We provide information inequalities extending those found in the independent case.

Probability · Mathematics 2007-05-23 Oliver Johnson

We compare two different techniques for proving non-Shannon-type information inequalities. The first one is the original Zhang-Yeung's method, commonly referred to as the copy/pasting lemma/trick. The copy lemma was used to derive the first…

Information Theory · Computer Science 2013-02-14 Tarik Kaced

Bounds on information combining are entropic inequalities that determine how the information, or entropy, of a set of random variables can change when they are combined in certain prescribed ways. Such bounds play an important role in…

Information Theory · Computer Science 2020-11-10 Christoph Hirche

Entropy and differential entropy are important quantities in information theory. A tractable extension to singular random variables-which are neither discrete nor continuous-has not been available so far. Here, we present such an extension…

Information Theory · Computer Science 2017-01-04 Günther Koliander , Georg Pichler , Erwin Riegler , Franz Hlawatsch

We investigate quantum R\'enyi entropic quantities, specifically those derived from 'sandwiched' divergence. This divergence is one of several proposed R\'enyi generalisations of the quantum relative entropy. We may define R\'enyi…

Quantum Physics · Physics 2021-10-04 Alexander McKinlay

Using joint Shannon entropy, we propose an inequality for a four-level system, which is satisfied in any non-contextual realist hidden variable model. We show that this entropic inequality is violated by quantum mechanics for a range of…

Quantum Physics · Physics 2013-01-22 A. K. Pan , M. Sumanth , P. K. Panigrahi

While most useful information theoretic inequalities can be deduced from the basic properties of entropy or mutual information, up to now Shannon's entropy power inequality (EPI) is an exception: Existing information theoretic proofs of the…

Information Theory · Computer Science 2016-11-17 Olivier Rioul
‹ Prev 1 2 3 10 Next ›