On characterization of entropy function via information inequalities
From MaRDI portal
Recommendations
Cited in
(72)- An impossibility result on graph secret sharing
- Matroid representations by partitions
- On distinct sums and distinct distances.
- A combinatorial approach to information inequalities
- Improving the linear programming technique in the search for lower bounds in secret sharing
- Classes of matroids closed under minors and principal extensions
- Finding lower bounds on the complexity of secret sharing schemes by linear programming
- On abelian and homomorphic secret sharing schemes
- Clustering with respect to the information distance
- Common information, matroid representation, and secret sharing for matroid ports
- On the tightness of the Zhang-Yeung inequality for Gaussian vectors
- Time series analysis of categorical data using auto-mutual information
- Inequalities for the ranks of multipartite quantum states
- Adhesivity of polymatroids
- A new inequality for the von Neumann entropy
- The holographic entropy cone
- Holographic entropy inequalities and gapped phases of matter
- Facets of entropy
- Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting)
- Guessing games on triangle-free graphs
- Secret-Sharing Schemes: A Survey
- On secret sharing schemes, matroids and polymatroids
- A note on the absolute epsilon entropy
- scientific article; zbMATH DE number 3884087 (Why is no real title available?)
- Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
- A family of generalized quantum entropies: definition and properties
- scientific article; zbMATH DE number 5017031 (Why is no real title available?)
- On entropy, information inequalities, and groups
- Balanced information inequalities
- An Extremal Inequality Motivated by Multiterminal Information-Theoretic Problems
- A construction method of matroidal networks
- scientific article; zbMATH DE number 3956959 (Why is no real title available?)
- Independence Inequality of Entropies
- A framework for linear information inequalities
- Analysing causal structures with entropy
- On solution sets of information inequalities
- Integrity constraints revisited: from exact to approximate implication
- Inequalities for space-bounded Kolmogorov complexity
- Probabilistic inequalities for evaluating structural network measures
- Spanoids -- an abstraction of spanning structures, and a barrier for LCCs
- Multi-variate correlation and mixtures of product measures.
- Introduction to secret-sharing
- Upper concave envelopes and auxiliary random variables
- Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid
- Stabilizer information inequalities from phase space distributions
- Matroids Can Be Far from Ideal Secret Sharing
- Violations of the Ingleton inequality and revising the four-atom conjecture.
- Tropical probability theory and an application to the entropic cone
- Using multiobjective optimization to map the entropy region
- On the relation between the subadditivity cone and the quantum entropy cone
- Selfadhesivity in Gaussian conditional independence structures
- Connectomes and properties of quantum entanglement
- On ideal and weakly-ideal access structures
- Inequalities for entropies and dimensions
- New inequalities for subspace arrangements
- The entropic approach to causal correlations
- Stability of properties of Kolmogorov complexity under relativization
- Recent progresses in characterising information inequalities
- On a connection between information and group lattices
- Estimation of average differential entropy for a stationary ergodic space-time random field on a bounded area
- Self-adhesivity in lattices of abstract conditional independence models
- No Eleventh Conditional Ingleton Inequality
- Decision problems in information theory
- A note on extension properties and representations of matroids
- Algorithmic construction of SSA-compatible extreme rays of the subadditivity cone and the N = 6 solution
- \textsf{PANDA}: query evaluation in submodular width
- Bounds on guessing numbers and secret sharing combining information theory methods.
- On the optimization of bipartite secret sharing schemes
- Non-linear information inequalities
- Partitioning multi-dimensional sets in a small number of ``uniform parts
- All inequalities for the relative entropy
- A dropping proof of an entropy inequality
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)
