Efficient representation of lattice path matroids
From MaRDI portal
Cites work
- Characterizing Ideal Weighted Threshold Secret Sharing
- Deterministic truncation of linear matroids
- Efficient explicit constructions of compartmented secret sharing schemes
- Efficient Explicit Constructions of Multipartite Secret Sharing Schemes
- Excluded minors for Boolean polymatroids
- Hierarchical threshold secret sharing
- scientific article; zbMATH DE number 4123667 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- Ideal hierarchical secret sharing and lattice path matroids
- Ideal Hierarchical Secret Sharing Schemes
- Ideal multipartite secret sharing schemes
- Ideal uniform multipartite secret sharing schemes
- Lattice path matroids: Enumerative aspects and Tutte polynomials
- Lattice path matroids: structural properties
- Linear representation of transversal matroids and gammoids parameterized by rank
- Multipartite secret sharing by bivariate interpolation
- Natural Generalizations of Threshold Secret Sharing
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- On secret sharing schemes, matroids and polymatroids
- On sets of vectors of a finite vector space in which every subset of basis size is a basis
- On sets of vectors of a finite vector space in which every subset of basis size is a basis. II
- On the classification of ideal secret sharing schemes
- On the representability of the biuniform matroid
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- Quasipolynomial representation of transversal matroids with applications in parameterized complexity
- Secret sharing schemes with bipartite access structure
- Secret-Sharing Schemes: A Survey
- Weight Enumeration and the Geometry of Linear Codes
Cited in
(1)
This page was built for publication: Efficient representation of lattice path matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6965532)
