Two Constructions on Limits of Entropy Functions
Author:
- 26 December 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 53 (1) , 320-330
Abstract
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 sharingKeywords
This publication has 39 references indexed in Scilit:
- Secret Sharing Schemes with Three or Four Minimal Qualified SubsetsDesigns, Codes and Cryptography, 2005
- Excluded minors for Boolean polymatroidsDiscrete Mathematics, 2001
- Inequalities for Shannon Entropy and Kolmogorov ComplexityJournal of Computer and System Sciences, 2000
- Common randomness in information theory and cryptography. II. CR capacityIEEE Transactions on Information Theory, 1998
- Universally ideal secret-sharing schemesIEEE Transactions on Information Theory, 1994
- Semimodular Functions1986
- Semimodular Functions and Combinatorial GeometriesTransactions of the American Mathematical Society, 1978
- Rado's theorem for polymatroidsMathematical Proceedings of the Cambridge Philosophical Society, 1975
- Aspects of the theory of hypermatroids1974
- Conditions for representability and transversality of matroidsLecture Notes in Mathematics, 1971