Common information, matroid representation, and secret sharing for matroid ports

Michael Bamiloshin, Aner Ben-Efraim, Oriol Farràs, Carles Padró

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


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.

Original languageEnglish
Pages (from-to)143-166
Number of pages24
JournalDesigns, Codes, and Cryptography
Issue number1
StatePublished - 1 Jan 2021
Externally publishedYes


  • Common information
  • Information inequalities
  • Linear programming
  • Matroid representation
  • Secret sharing

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science Applications
  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'Common information, matroid representation, and secret sharing for matroid ports'. Together they form a unique fingerprint.

Cite this