A combinatorial approach to information inequalities

DOI10.4310/CIS.2001.V1.N3.A1zbMATH Open1041.94523OpenAlexW2330864293MaRDI QIDQ1429263FDOQ1429263

Authors: Terence H. Chan 

Publication date: 18 May 2004

Published in: Communications in Information and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4310/cis.2001.v1.n3.a1

Recommendations

• A new class of non-Shannon-type inequalities for entropies
• On a relation between information inequalities and group theory
• Piecewise linear conditional information inequality
• On characterization of entropy function via information inequalities
• On entropy, information inequalities, and groups

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Combinatorial inequalities (05A20)

Cited In (13)

• A dropping proof of an entropy inequality
• Facets of entropy
• Partitioning multi-dimensional sets in a small number of ``uniform parts
• A new class of non-Shannon-type inequalities for entropies
• An information - theoretic proof of Hadamard's inequality (Corresp.)
• Balanced information inequalities
• Title not available (Why is that?)
• On the tightness of the Zhang-Yeung inequality for Gaussian vectors
• Adhesivity of polymatroids
• No Eleventh Conditional Ingleton Inequality
• Fredman–Komlós bounds and information theory
• Recent progresses in characterising information inequalities
• Inequalities for space-bounded Kolmogorov complexity

This page was built for publication: A combinatorial approach to information inequalities

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