Secret Sharing and Non-Shannon Information Inequalities
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Divergence from factorizable distributions and matroid representations by partitions
IEEE Transactions on Information Theory
Matroids can be far from ideal secret sharing
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Information inequalities for joint distributions, with interpretations and applications
IEEE Transactions on Information Theory
Ideal hierarchical secret sharing schemes
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
On the optimization of bipartite secret sharing schemes
Designs, Codes and Cryptography
Designs, Codes and Cryptography
Sensor fusion: from dependence analysis via matroid bases to online synthesis
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Size and Treewidth Bounds for Conjunctive Queries
Journal of the ACM (JACM)
Entropy and set cardinality inequalities for partition-determined functions
Random Structures & Algorithms
| Hi-index | 754.96 |
The correspondence between the subvectors of a random vector and their Shannon entropies gives rise to an entropy function. Limits of the entropy functions are closed to convolutions with modular polymatroids, and when integer-valued also to free expansions. The problem of description of the limits of entropy functions is reduced to those limits that correspond to matroids. Related results on entropy functions are reviewed with regard to polymatroid and matroid theories, and perfect and ideal secret sharing