A proof of the Fisher information inequality via a data processing argument

DOI10.1109/18.669301zbMath0901.62005DBLPjournals/tit/Zamir98OpenAlexW2171801319WikidataQ56384532 ScholiaQ56384532MaRDI QIDQ4400347

Ram Zamir

Publication date: 29 November 1998

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/12709d60f297aaa352e4f50afbc980787f0cafbd

zbMATH Keywords

Fisher informationnon-Gaussian noiseprefilteringentropy-power inequalitylinear modelingCramer-Rao bounddata-processing inequality

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10)

Related Items (14)

Some inequalities related to the Stam inequality. ⋮ Basic inequalities for weighted entropies ⋮ INEQUALITIES FOR THE DEPENDENT GAUSSIAN NOISE CHANNELS BASED ON FISHER INFORMATION AND COPULAS ⋮ Weighted entropy: basic inequalities ⋮ Geometric inequalities from phase space translations ⋮ Ensuring privacy with constrained additive noise by minimizing Fisher information ⋮ Extreme Fisher information, non-equilibrium thermodynamics and reciprocity relations ⋮ Stam inequality on \(\mathbb Z_n\) ⋮ Contribution to the theory of Pitman estimators ⋮ The conditional entropy power inequality for Gaussian quantum states ⋮ A note on weighted least square distribution fitting and full standardization of the empirical distribution function ⋮ Ridge regression and asymptotic minimax estimation over spheres of growing dimension ⋮ AIMS: average information matrix splitting ⋮ Unnamed Item

This page was built for publication: A proof of the Fisher information inequality via a data processing argument