Constructions of new matroids and designs over \(\mathbb{F}_q\)
DOI10.1007/s10623-022-01087-3OpenAlexW4299348212WikidataQ114849683 ScholiaQ114849683MaRDI QIDQ2698339
Sorina Ionica, Elif Saçıkara, Eimear Byrne, Michela Ceria, Relinde P. M. J. Jurrius
Publication date: 21 April 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.03369
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) (q)-calculus and related topics (05A30) Combinatorial aspects of block designs (05B05) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (4)
Cites Work
- On the automorphism group of a binary \(q\)-analog of the Fano plane
- Large sets of subspace designs
- Designs over finite fields
- 2-designs over \(GF(q)\)
- t-designs on hypergraphs
- A new family of 2-designs over GF\((q)\) admitting SL\(_m(q^l)\)
- Defining the \(q\)-analogue of a matroid
- The order of the automorphism group of a binary \(q\)-analog of the Fano plane is at most two
- Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
- On the inequalities of \(t\)-designs over a finite field
- Constructions of new \(q\)-cryptomorphisms
- Rank-metric codes and \(q\)-polymatroids
- Designs over finite fields by difference methods
- EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
- An Assmus--Mattson Theorem for Rank Metric Codes
- Intersection Numbers For Subspace Designs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Constructions of new matroids and designs over \(\mathbb{F}_q\)
