On characterization of entropy function via information inequalities
From MaRDI portal
Publication:4701115
DOI10.1109/18.681320zbMath1153.94336OpenAlexW2113940092MaRDI QIDQ4701115
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
Related Items (50)
Guessing games on triangle-free graphs ⋮ On Entropy, Information Inequalities, and Groups ⋮ Non-linear information inequalities ⋮ The holographic entropy cone ⋮ Holographic entropy inequalities and gapped phases of matter ⋮ Inequalities for space-bounded Kolmogorov complexity ⋮ Partitioning multi-dimensional sets in a small number of ``uniform parts ⋮ A family of generalized quantum entropies: definition and properties ⋮ Improving the linear programming technique in the search for lower bounds in secret sharing ⋮ Time series analysis of categorical data using auto-mutual information ⋮ Clustering with respect to the information distance ⋮ A construction method of matroidal networks ⋮ All inequalities for the relative entropy ⋮ New inequalities for subspace arrangements ⋮ On the relation between the subadditivity cone and the quantum entropy cone ⋮ Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements ⋮ Stability of properties of Kolmogorov complexity under relativization ⋮ Selfadhesivity in Gaussian conditional independence structures ⋮ Connectomes and properties of quantum entanglement ⋮ On ideal and weakly-ideal access structures ⋮ Inequalities for entropies and dimensions ⋮ Spanoids---An Abstraction of Spanning Structures, and a Barrier for LCCs ⋮ The entropic approach to causal correlations ⋮ Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting) ⋮ Finding lower bounds on the complexity of secret sharing schemes by linear programming ⋮ Multi-variate correlation and mixtures of product measures ⋮ On distinct sums and distinct distances. ⋮ Common information, matroid representation, and secret sharing for matroid ports ⋮ Unnamed Item ⋮ Inequalities for the ranks of multipartite quantum states ⋮ Recent progresses in characterising information inequalities ⋮ On a connection between information and group lattices ⋮ Adhesivity of polymatroids ⋮ Secret-Sharing Schemes: A Survey ⋮ Probabilistic inequalities for evaluating structural network measures ⋮ Analysing causal structures with entropy ⋮ Stabilizer information inequalities from phase space distributions ⋮ Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid ⋮ On secret sharing schemes, matroids and polymatroids ⋮ Classes of matroids closed under minors and principal extensions ⋮ Matroids Can Be Far from Ideal Secret Sharing ⋮ Using multiobjective optimization to map the entropy region ⋮ Introduction to Secret-Sharing ⋮ On abelian and homomorphic secret sharing schemes ⋮ On the optimization of bipartite secret sharing schemes ⋮ An impossibility result on graph secret sharing ⋮ A new inequality for the von Neumann entropy ⋮ Matroid representations by partitions ⋮ Violations of the Ingleton inequality and revising the four-atom conjecture ⋮ Tropical probability theory and an application to the entropic cone
This page was built for publication: On characterization of entropy function via information inequalities
