Common Information, Matroid Representation, and Secret Sharing for Matroid Ports
arXiv:2002.08108 · doi:10.1007/s10623-020-00811-1
Abstract
Linear information and rank inequalities as, for instance, Ingleton inequality, are useful tools in information theory and matroid theory. Even though many such inequalities have been found, it seems that most of them remain undiscovered. Improved results have been obtained in recent works by using the properties from which they are derived instead of the inequalities themselves. We apply here this strategy to the classification of matroids according to their representations and to the search for bounds on secret sharing for matroid ports.
arXiv commentUpdate of the article published in Designs, Codes and Cryptography. 24 pages, 1 figure, 2 tables
References in corpus (10)
- Representation of matroids
- Non-Shannon Information Inequalities in Four Random Variables
- New inequalities for subspace arrangements
- Linear rank inequalities on five or more variables
- Representing some non-representable matroids
- Characteristic-Dependent Linear Rank Inequalities with Applications to Network Coding
- Secret-Sharing Matroids need not be Algebraic
- How to Use Undiscovered Information Inequalities: Direct Applications of the Copy Lemma
- Equivalence of Two Proof Techniques for Non-Shannon-type Inequalities
- Matroids over one-dimensional groups