English
Related papers

Related papers: A conditional Entropy Power Inequality for depende…

200 papers

We analyse an analog of the entropy-power inequality for the weighted entropy.

Information Theory · Computer Science 2015-03-10 Yuri Suhov , Salimeh Yasaei Sekeh , Mark Kelbert

We prove a tight uniform continuity bound for the conditional Shannon entropy of discrete finitely supported random variables in terms of total variation distance.

Information Theory · Computer Science 2020-09-29 Mohammad A. Alhejji , Graeme Smith

It is known that the Entropy Power Inequality (EPI) always holds if the random variables have density. Not much work has been done to identify discrete distributions for which the inequality holds with the differential entropy replaced by…

Information Theory · Computer Science 2012-05-22 Naresh Sharma , Smarajit Das , Siddharth Muthukrishnan

Shannon's Entropy Power Inequality can be viewed as characterizing the minimum differential entropy achievable by the sum of two independent random variables with fixed differential entropies. The entropy power inequality has played a key…

Information Theory · Computer Science 2012-07-31 Varun Jog , Venkat Anantharam

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

An extension of the entropy power inequality to the form $N_r^\alpha(X+Y) \geq N_r^\alpha(X) + N_r^\alpha(Y)$ with arbitrary independent summands $X$ and $Y$ in $\mathbb{R}^n$ is obtained for the R\'enyi entropy and powers $\alpha \geq…

Information Theory · Computer Science 2017-10-25 Sergey Bobkov , Arnaud Marsiglietti

We show that Shannon's entropy--power inequality admits a strengthened version in the case in which the densities are log-concave. In such a case, in fact, one can extend the Blachman--Stam argument to obtain a sharp inequality for the…

Information Theory · Computer Science 2014-08-19 Giuseppe Toscani

We have presented a new axiomatic derivation of Shannon Entropy for a discrete probability distribution on the basis of the postulates of additivity and concavity of the entropy function.We have then modified shannon entropy to take account…

Quantum Physics · Physics 2007-05-23 C. G. Chakrabarti , Indranil Chakrabarty

We study constrained versions of the Ingleton inequality in the entropic setting and quantify its stability under small violations of conditional independence. Although the classical Ingleton inequality fails for general entropy profiles,…

Information Theory · Computer Science 2026-03-24 Rostislav Matveev , Andrei Romashchenko

We show that an information-theoretic property of Shannon's entropy power, known as concavity of entropy power, can be fruitfully employed to prove inequalities in sharp form. In particular, the concavity of entropy power implies the…

Information Theory · Computer Science 2012-07-13 Giuseppe Toscani

Shannon's entropy power inequality (EPI) can be viewed as a statement of concavity of an entropic function of a continuous random variable under a scaled addition rule: $$f(\sqrt{a}\,X + \sqrt{1-a}\,Y) \ge a f(X) + (1-a) f(Y) \quad \forall…

Quantum Physics · Physics 2016-06-06 Koenraad Audenaert , Nilanjana Datta , Maris Ozols

Shannon's metric of "Entropy" of information is a foundational concept of information theory. This article is a primer for novices that presents an intuitive way of understanding, remembering, and/or reconstructing Shannon's Entropy metric…

Information Theory · Computer Science 2014-05-09 Sriram Vajapeyam

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

The paper examines relationships between the conditional Shannon entropy and the expectation of $\ell_{\alpha}$-norm for joint probability distributions. More precisely, we investigate the tight bounds of the expectation of…

Information Theory · Computer Science 2020-08-24 Yuta Sakai , Ken-ichi Iwata

The paper establishes the equality condition in the I-MMSE proof of the entropy power inequality (EPI). This is done by establishing an exact expression for the deficit between the two sides of the EPI. Interestingly, a necessary condition…

Information Theory · Computer Science 2017-03-23 Alex Dytso , Ronit Bustin , H. Vincent Poor , Shlomo Shamai

We propose a generalization of the quantum entropy power inequality involving conditional entropies. For the special case of Gaussian states, we give a proof based on perturbation theory for symplectic spectra. We discuss some implications…

Quantum Physics · Physics 2015-06-15 Robert Koenig

The matrix version of the entropy-power inequality for real or complex coefficients and variables is proved using a transportation argument that easily settles the equality case. An application to blind source extraction is given.

Information Theory · Computer Science 2019-06-04 Olivier Rioul , Ram Zamir

In this paper, we studied, at first, the influence of the energy-dependent potentials on the one-dimensionless Klein-Gordon oscillator. Then, the Shannon entropy and Fisher information of this system are investigated. The position and…

Quantum Physics · Physics 2018-04-04 Abdelmalek Boumali , Malika Labidi

We use the formalism of 'Maximum Principle of Shannon's Entropy' to derive the general power law distribution function, using what seems to be a reasonable physical assumption, namely, the demand of a constant mean "internal order"…

Statistical Mechanics · Physics 2007-05-23 Yaniv Dover

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