On characterization of entropy function via information inequalities
From MaRDI portal
Publication:4701115
DOI10.1109/18.681320zbMATH Open1153.94336OpenAlexW2113940092MaRDI QIDQ4701115FDOQ4701115
Authors: Zhen Zhang, Raymond W. Yeung
Publication date: 21 November 1999
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/790b416cf19c8d202541d650d04516251e98c840
Recommendations
Cited In (66)
- Inequalities for entropies and dimensions
- Estimation of average differential entropy for a stationary ergodic space-time random field on a bounded area
- Selfadhesivity in Gaussian conditional independence structures
- On ideal and weakly-ideal access structures
- Multi-variate correlation and mixtures of product measures.
- Self-adhesivity in lattices of abstract conditional independence models
- No Eleventh Conditional Ingleton Inequality
- A dropping proof of an entropy inequality
- On the relation between the subadditivity cone and the quantum entropy cone
- A combinatorial approach to information inequalities
- Matroids Can Be Far from Ideal Secret Sharing
- Title not available (Why is that?)
- Holographic entropy inequalities and gapped phases of matter
- Using multiobjective optimization to map the entropy region
- Upper concave envelopes and auxiliary random variables
- Facets of entropy
- Title not available (Why is that?)
- Partitioning multi-dimensional sets in a small number of ``uniform parts
- Analysing causal structures with entropy
- Guessing games on triangle-free graphs
- Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid
- Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
- A new inequality for the von Neumann entropy
- Title not available (Why is that?)
- All inequalities for the relative entropy
- Introduction to secret-sharing
- Probabilistic inequalities for evaluating structural network measures
- Inequalities for the ranks of multipartite quantum states
- Spanoids -- an abstraction of spanning structures, and a barrier for LCCs
- On solution sets of information inequalities
- Matroid representations by partitions
- Improving the linear programming technique in the search for lower bounds in secret sharing
- An impossibility result on graph secret sharing
- The holographic entropy cone
- Balanced information inequalities
- New inequalities for subspace arrangements
- On a connection between information and group lattices
- Finding lower bounds on the complexity of secret sharing schemes by linear programming
- Classes of matroids closed under minors and principal extensions
- Stability of properties of Kolmogorov complexity under relativization
- Common information, matroid representation, and secret sharing for matroid ports
- A family of generalized quantum entropies: definition and properties
- Stabilizer information inequalities from phase space distributions
- On the tightness of the Zhang-Yeung inequality for Gaussian vectors
- Clustering with respect to the information distance
- On the optimization of bipartite secret sharing schemes
- On abelian and homomorphic secret sharing schemes
- An Extremal Inequality Motivated by Multiterminal Information-Theoretic Problems
- Adhesivity of polymatroids
- On distinct sums and distinct distances.
- Independence Inequality of Entropies
- A construction method of matroidal networks
- The entropic approach to causal correlations
- On entropy, information inequalities, and groups
- On secret sharing schemes, matroids and polymatroids
- A note on the absolute epsilon entropy
- Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting)
- Recent progresses in characterising information inequalities
- Title not available (Why is that?)
- Tropical probability theory and an application to the entropic cone
- Violations of the Ingleton inequality and revising the four-atom conjecture.
- Secret-Sharing Schemes: A Survey
- Non-linear information inequalities
- Inequalities for space-bounded Kolmogorov complexity
- Time series analysis of categorical data using auto-mutual information
- Connectomes and properties of quantum entanglement
This page was built for publication: On characterization of entropy function via information inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701115)