Polymatroidal dependence structure of a set of random variables

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

Cited in

(33)

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

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)