Two Constructions on Limits of Entropy Functions
From MaRDI portal
Recommendations
Cited in
(20)- Classes of matroids closed under minors and principal extensions
- Secret sharing and duality
- On abelian and homomorphic secret sharing schemes
- Undecidability of \(c\)-arrangement matroid representations
- Extending Brickell-Davenport theorem to non-perfect secret sharing schemes
- Adhesivity of polymatroids
- Entropy and set cardinality inequalities for partition-determined functions
- Ideal hierarchical secret sharing schemes
- Multi-variate correlation and mixtures of product measures.
- Introduction to secret-sharing
- Matroids Can Be Far from Ideal Secret Sharing
- One-adhesive polymatroids.
- On typical encodings of multivariate ergodic sources.
- Tropical probability theory and an application to the entropic cone
- Using multiobjective optimization to map the entropy region
- Algebraic matroids are almost entropic
- On-line secret sharing
- On entropic and almost multilinear representability of matroids
- Sensor networks: from dependence analysis via matroid bases to online synthesis
- On the optimization of bipartite secret sharing schemes
This page was built for publication: Two Constructions on Limits of Entropy Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548187)