A dropping proof of an entropy inequality

DOI10.1016/j.aml.2007.08.011zbMath1147.94008OpenAlexW1986742542MaRDI QIDQ953887

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

entropy inequalitystrong subadditivity1-designdropping method

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Some intersection theorems for ordered sets and graphs
• An information-theoretic method in combinatorial theory
• Generalized rank functions and an entropy argument
• Nonnegative entropy measures of multivariate symmetric correlations
• Entropy and enumeration of Boolean functions

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