A small minimal blocking set in \(\mathrm{PG}(n,p^t)\), spanning a \((t-1)\)-space, is linear
From MaRDI portal
Publication:1952278
DOI10.1007/s10623-012-9751-xzbMath1286.51005arXiv1210.1003MaRDI QIDQ1952278
Geertrui Van de Voorde, Peter Sziklai
Publication date: 30 May 2013
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.1003
Cites Work
- On the linearity of higher-dimensional blocking sets
- On the code generated by the incidence matrix of points and \(k\)-spaces in \(\text{PG}(n,q)\) and its dual
- On small blocking sets and their linearity
- Blocking sets in Desarguesian affine and projective planes
- On the number of slopes of the graph of a function defined on a finite field
- On the size of a blocking set in \(\text{PG}(2,p)\)
- Proper blocking sets in projective spaces
- The number of directions determined by a function over a finite field.
- Small blocking sets in \(PG(2,p^3)\)
- Linear point sets and Rédei type \(k\)-blocking sets in \(\mathrm{PG}(n,q)\)
- On linear sets on a projective line
- On multiple blocking sets in Galois planes
- On 1-blocking sets in \(PG(n,q), n\geq 3\)
- Small blocking sets in higher dimensions