Zobrazeno 1 - 10
of 110
pro vyhledávání: '"Padró Carles"'
Autor:
Padró, Carles
Efficient deterministic algorithms to construct representations of lattice path matroids over finite fields are presented. They are built on known constructions of hierarchical secret sharing schemes, a recent characterization of hierarchical matroid
Externí odkaz:
http://arxiv.org/abs/2310.10489
We discuss several extension properties of matroids and polymatroids and their application as necessary conditions for the existence of different matroid representations, namely linear, folded linear, algebraic, and entropic representations. Iteratio
Externí odkaz:
http://arxiv.org/abs/2306.15085
Autor:
Martí-Farré Jaume, Padró Carles
Publikováno v:
Journal of Mathematical Cryptology, Vol 4, Iss 2, Pp 95-120 (2010)
The complexity of a secret sharing scheme is defined as the ratio between the maximum length of the shares and the length of the secret. The optimization of this parameter for general access structures is an important and very difficult open problem
Externí odkaz:
https://doaj.org/article/c58b49ad138842799c8e75672bbb5b1f
Publikováno v:
In Discrete Mathematics May 2024 347(5)
Bipartite secret sharing schemes have a bipartite access structure in which the set of participants is divided into two parts and all participants in the same part play an equivalent role. Such a bipartite scheme can be described by a \emph{staircase
Externí odkaz:
http://arxiv.org/abs/2103.04904
Publikováno v:
Des. Codes Cryptogr. 89(1): 143-166 (2021)
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 re
Externí odkaz:
http://arxiv.org/abs/2002.08108
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
SIAM J. Discrete Math., 27(3) (2013), 1482-1491
Every bi-uniform matroid is representable over all sufficiently large fields. But it is not known exactly over which finite fields they are representable, and the existence of efficient methods to find a representation for every given bi-uniform matr
Externí odkaz:
http://arxiv.org/abs/1407.7283
Autor:
Padró, Carles
Publikováno v:
El Ciervo, 2019 Sep 01. 69(777), 11-11.
Externí odkaz:
https://www.jstor.org/stable/45209216
Publikováno v:
El Ciervo, 2019 Jul 01. 69(776), 4-4.
Externí odkaz:
https://www.jstor.org/stable/45209855