Common Information, Matroid Representation, and Secret Sharing for Matroid Ports
Combinatorics
2022-03-31 v2 Information Theory
math.IT
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.
Keywords
Cite
@article{arxiv.2002.08108,
title = {Common Information, Matroid Representation, and Secret Sharing for Matroid Ports},
author = {Michael Bamiloshin and Aner Ben-Efraim and Oriol Farràs and Carles Padró},
journal= {arXiv preprint arXiv:2002.08108},
year = {2022}
}
Comments
Update of the article published in Designs, Codes and Cryptography. 24 pages, 1 figure, 2 tables