Polymatroidal dependence structure of a set of random variables

Combinatorial aspects of matroids and geometric lattices (05B35) Communication theory (94A05) Measures of information, entropy (94A17) Applications of design theory to circuits and networks (94C30) Circuits, networks (94C99)

Cited in

(38)

Matroids on partially ordered sets
Matroid representations by partitions
Improving the linear programming technique in the search for lower bounds in secret sharing
On the information ratio of non-perfect secret sharing schemes
Classes of matroids closed under minors and principal extensions
Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
Finding lower bounds on the complexity of secret sharing schemes by linear programming
Secret sharing and duality
On abelian and homomorphic secret sharing schemes
Attribute based diversification of seeds for targeted influence maximization
Submodular functions and rooted trees
Common information, matroid representation, and secret sharing for matroid ports
Extending Brickell-Davenport theorem to non-perfect secret sharing schemes
Minimizing ratio of monotone non-submodular functions
Adhesivity of polymatroids
Representability of matroids by c-arrangements is undecidable
Entropy and set cardinality inequalities for partition-determined functions
Information Theoretic Security for Encryption Based on Conditional Rényi Entropies
On secret sharing schemes, matroids and polymatroids
Recent advances in non-perfect secret sharing schemes
Mean mutual information and symmetry breaking for finite random fields
Linear threshold multisecret sharing schemes
Conditional Independences among Four Random Variables I
Finding a stable allocation in polymatroid intersection
Multi-variate correlation and mixtures of product measures.
One-adhesive polymatroids.
Algebraic matroids are almost entropic
On a connection between information and group lattices
No Eleventh Conditional Ingleton Inequality
New method to compute bounds on the optimal information rate of secret sharing schemes
Optimizing extension techniques for discovering non-algebraic matroids
A note on extension properties and representations of matroids
Optimal complexity of secret sharing schemes with four minimal qualified subsets
Polynomial secret sharing schemes and algebraic matroids
On entropic and almost multilinear representability of matroids
Canonical decompositions of symmetric submodular systems
On the optimization of bipartite secret sharing schemes
Submodular function minimization

This page was built for publication: Polymatroidal dependence structure of a set of random variables

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