Saturating linear sets in PG(2,q^4)
Combinatorial aspects of packing and covering (05B40) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial structures in finite projective spaces (51E20) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
An \(\mathbb{F}_q\)-linear set \(L_U\subseteq\mathrm{PG}(k-1,q^m)\) is said to be \(\rho\)-saturating if any point in \(\mathrm{PG}(k-1,q^m)\) belongs to at least one subspace of projective dimension \(\rho-1\) spanned by \(\rho\) points of \(L_U.\) The main problem is the determination of the smallest rank of a \(\rho\)-saturating \(\mathbb{F}_q\)-linear set in \(\mathrm{PG}(k-1,q^m),\) denoted by \(s_{q^m/q}(k, \rho).\)\N\NIn [\textit{D. Bartoli} et al., Finite Fields Appl. 95, Article ID 102390, 27 p. (2024; Zbl 1533.05049)], the following bounds \(4\leq s_{q^4/q}(3, 2)\leq 5\) were proven, and when \(q\) is large and even \(s_{q^4/q}(3, 2) = 5. \) In this paper, the last equation is proven for any prime \(q.\) The two results towards this goal are: a 1-saturating linear set of rank 4 cannot be contained in a line; and a 1-saturating linear set needs to be scattered, with respect to the lines or scattered with the property that all the lines have weight at most two except one of weight three. As a consequence of the main result, it's shown that all the linear sets of rank 5 in \(\mathrm{PG}(2, q^4),\) different from a line, are 1-saturating.
- \(\mathbb F _q\)-linear blocking sets in \(PG(2,q^4)\)
- A geometric approach to rank metric codes and a classification of constant weight codes
- A new family of linear maximum rank distance codes
- Bilinear forms over a finite field, with applications to coding theory
- Cones from maximum \(h\)-scattered linear sets and a stability result for cylinders from hyperovals
- Connections between scattered linear sets and MRD-codes
- Constructing saturating sets in projective spaces using subgeometries
- Covering radius of matrix codes endowed with the rank metric
- scientific article; zbMATH DE number 1024657 (Why is no real title available?)
- scientific article; zbMATH DE number 1833075 (Why is no real title available?)
- scientific article; zbMATH DE number 6541785 (Why is no real title available?)
- Isometries for rank distance and permutation group of gabidulin codes
- Linear cutting blocking sets and minimal codes in the rank metric
- Linearized polynomials over finite fields revisited
- MRD-codes and linear sets
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- On linear sets on a projective line
- On saturating sets in projective spaces.
- On the equivalence of linear sets
- Packing and Covering Properties of Rank Metric Codes
- Rank-metric codes and their applications
- Rank-metric codes, linear sets, and their duality
- Saturating linear sets of minimal rank
- Saturating sets in projective planes and hypergraph covers
- Saturating systems and the rank-metric covering radius
- Scattered spaces with respect to a spread in \(\text{PG}(n,q)\)
- The minimum size of a linear set
- Theory of codes with maximum rank distance
This page was built for publication: Saturating linear sets in \(\mathrm{PG}(2,q^4)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565506)
