Polymatroidal dependence structure of a set of random variables
From MaRDI portal
Publication:4170638
DOI10.1016/S0019-9958(78)91063-XzbMath0388.94006MaRDI QIDQ4170638
Publication date: 1978
Published in: Information and Control (Search for Journal in Brave)
Circuits, networks (94C99) Combinatorial aspects of matroids and geometric lattices (05B35) Applications of design theory to circuits and networks (94C30) Measures of information, entropy (94A17) Communication theory (94A05)
Related Items
Entropy and set cardinality inequalities for partition-determined functions, Improving the linear programming technique in the search for lower bounds in secret sharing, Recent Advances in Non-perfect Secret Sharing Schemes, Finding a Stable Allocation in Polymatroid Intersection, Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested, Information Theoretic Security for Encryption Based on Conditional Rényi Entropies, On the information ratio of non-perfect secret sharing schemes, Algebraic matroids are almost entropic, Conditional Independences among Four Random Variables I, Mean mutual information and symmetry breaking for finite random fields, Finding lower bounds on the complexity of secret sharing schemes by linear programming, Representability of matroids by \(c\)-arrangements is undecidable, Multi-variate correlation and mixtures of product measures, Linear threshold multisecret sharing schemes, Common information, matroid representation, and secret sharing for matroid ports, On a connection between information and group lattices, Adhesivity of polymatroids, Extending Brickell-Davenport theorem to non-perfect secret sharing schemes, Optimal complexity of secret sharing schemes with four minimal qualified subsets, On secret sharing schemes, matroids and polymatroids, Classes of matroids closed under minors and principal extensions, Submodular function minimization, Secret sharing and duality, On abelian and homomorphic secret sharing schemes, Attribute based diversification of seeds for targeted influence maximization, Matroids on partially ordered sets, Canonical decompositions of symmetric submodular systems, On the optimization of bipartite secret sharing schemes, Minimizing ratio of monotone non-submodular functions, Matroid representations by partitions, Submodular functions and rooted trees, One-adhesive polymatroids
