Articles producció científica> Enginyeria Informàtica i Matemàtiques

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

  • Identification data

    Identifier: imarina:9048282
    Authors:
    Bamiloshin, MichaelBen-Efraim, AnerFarras, OriolPadro, Carles
    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.
  • Others:

    Author, as appears in the article.: Bamiloshin, Michael; Ben-Efraim, Aner; Farras, Oriol; Padro, Carles;
    Department: Enginyeria Informàtica i Matemàtiques
    URV's Author/s: Bamiloshin, Michael Olugbenga / Farràs Ventura, Oriol
    Project code: Grant agreement No. 713679
    Keywords: Secret sharing Schemes Networks Matroid representation Linear programming Information inequalities Inequalities Common information Bounds
    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.
    Thematic Areas: Theoretical computer science Mathematics, applied Matemática / probabilidade e estatística Engenharias iv Engenharias iii Discrete mathematics and combinatorics Computer science, theory & methods Computer science applications Ciência da computação Astronomia / física Applied mathematics
    licence for use: https://creativecommons.org/licenses/by/3.0/es/
    Author's mail: michaelolugbenga.bamiloshin@urv.cat oriol.farras@urv.cat
    Author identifier: 0000-0002-4076-3833 0000-0002-7495-5980
    Record's date: 2024-07-27
    Papper version: info:eu-repo/semantics/acceptedVersion
    Link to the original source: https://link.springer.com/article/10.1007/s10623-020-00811-1
    Funding program: Martí i Franquès COFUND Doctoral Programme
    Licence document URL: https://repositori.urv.cat/ca/proteccio-de-dades/
    Papper original source: Designs Codes And Cryptography. 89 (1): 143-166
    APA: Bamiloshin, Michael; Ben-Efraim, Aner; Farras, Oriol; Padro, Carles; (2021). Common information, matroid representation, and secret sharing for matroid ports. Designs Codes And Cryptography, 89(1), 143-166. DOI: 10.1007/s10623-020-00811-1
    Acronym: MFP
    Article's DOI: 10.1007/s10623-020-00811-1
    Entity: Universitat Rovira i Virgili
    Journal publication year: 2021
    Funding program action: Marie Skłodowska-Curie Actions - European Union's Horizon 2020 research and innovation programme
    Publication Type: Journal Publications
  • Keywords:

    Applied Mathematics,Computer Science Applications,Computer Science, Theory & Methods,Discrete Mathematics and Combinatorics,Mathematics, Applied,Theoretical Computer Science
    Secret sharing
    Schemes
    Networks
    Matroid representation
    Linear programming
    Information inequalities
    Inequalities
    Common information
    Bounds
    Theoretical computer science
    Mathematics, applied
    Matemática / probabilidade e estatística
    Engenharias iv
    Engenharias iii
    Discrete mathematics and combinatorics
    Computer science, theory & methods
    Computer science applications
    Ciência da computação
    Astronomia / física
    Applied mathematics
  • Documents:

  • Cerca a google

    Search to google scholar