A dropping proof of an entropy inequality

DOI10.1016/J.AML.2007.08.011MaRDI QIDQ953887zbMATH OpenOpenAlexFDO

Authors Masahiro Yanagida, Yasuichi Horibe

Publication date 6 November 2008

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.aml.2007.08.011

zbMATH Keywords

strong subadditivityentropy inequality1-designdropping method

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• scientific article; zbMATH DE number 1121120
• A combinatorial approach to information inequalities
• Entropy: An inequality
• scientific article; zbMATH DE number 1983989
• On characterization of entropy function via information inequalities

Cites work

• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• An information-theoretic method in combinatorial theory
• Entropy and enumeration of Boolean functions
• Generalized rank functions and an entropy argument
• Nonnegative entropy measures of multivariate symmetric correlations
• Some intersection theorems for ordered sets and graphs

Cited in

(2)

• A simple proof of Wehrl's conjecture on entropy
• A proof of the estimation from below in Pesin's entropy formula

This page was built for publication: A dropping proof of an entropy inequality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953887)