Secret-sharing matroids need not be algebraic

DOI10.1016/j.disc.2016.02.012zbMath1337.05016arXiv1403.6363OpenAlexW2345183660MaRDI QIDQ284751

Aner Ben-Efraim

Publication date: 18 May 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.6363

zbMATH Keywords

algebraic matroidsmulti-linear matroids

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Theory of matrix inversion and generalized inverses (15A09) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (6)

Algebraic matroids and Frobenius flocks ⋮ Algebraic matroids are almost entropic ⋮ Common information, matroid representation, and secret sharing for matroid ports ⋮ Classes of matroids closed under minors and principal extensions ⋮ Secret sharing schemes for ports of matroids of rank 3 ⋮ A note on representing dowling geometries by partitions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matroids algebraic over F(t) are algebraic over F
• Algebraic characteristic sets of matroids
• On the classification of ideal secret sharing schemes
• On secret-sharing matroids
• Matroid representations by partitions
• Almost affine codes
• Skew partial fields, multilinear representations of matroids, and a matrix tree theorem
• Dowling geometries representable over rings
• A class of geometric lattices based on finite groups
• Non‐Algebraic Matroids exist
• On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory
• Multi-linear Secret-Sharing Schemes

This page was built for publication: Secret-sharing matroids need not be algebraic