Saturating linear sets of minimal rank
DOI10.1016/j.ffa.2024.102390arXiv2306.17081OpenAlexW4392010386MaRDI QIDQ6191095
Daniele Bartoli, Giuseppe Marino, Martino Borello
Publication date: 6 March 2024
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2306.17081
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial structures in finite projective spaces (51E20) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Combinatorial aspects of packing and covering (05B40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear sets in finite projective spaces
- Maximum scattered linear sets and complete caps in Galois spaces
- Saturated configurations of points in projective Galois spaces
- Normal spreads
- On saturating sets in projective spaces.
- Scattered spaces with respect to a spread in \(\text{PG}(n,q)\)
- On saturating sets in small projective geometries
- Linear \((q+1)\)-fold blocking sets in \(\text{PG} (2,q^4)\)
- Maximum scattered linear sets and MRD-codes
- Saturating sets in projective planes and hypergraph covers
- Small complete caps in spaces of even characteristic
- Generalising the scattered property of subspaces
- Constructing saturating sets in projective spaces using subgeometries
- Linear cutting blocking sets and minimal codes in the rank metric
- Improved explicit estimates on the number of solutions of equations over a finite field
- Linear sets from projection of Desarguesian spreads
- Packing and Covering Properties of Rank Metric Codes
- An Assmus--Mattson Theorem for Rank Metric Codes
- Covering Radius of Matrix Codes Endowed with the Rank Metric
- Number of Points of Varieties in Finite Fields
This page was built for publication: Saturating linear sets of minimal rank
