Blocking sets and partial spreads in finite projective spaces

Cited In (40)

Extending pseudo-arcs in odd characteristic
An upper bound on the number of rational points of arbitrary projective varieties over finite fields
Translation nets: A survey
The classification of the smallest nontrivial blocking sets in \(PG(n,2)\)
Sum-free sets in vector spaces over \(GF(2)\)
Title not available (Why is that?)
On the extendability of quasidivisible Griesmer arcs
An extension theorem for arcs and linear codes
Maximal partial spreads and two-weight codes
A geometric version of the Andrásfai-Erdős-Sós theorem
Small blocking sets in higher dimensions
Blocking sets in finite projective spaces and uneven binary codes
On sets of type \((m,m+q)_2\) in \(\mathrm{PG}(3,q)\)
Partial spreads over \({\mathbb{Z}}_ q\)
Gaussian partitions
Characterisations of elementary pseudo-caps and good eggs
Extendability of linear codes over \(\operatorname {GF}(q)\) with minimum distance \(d\), \(\operatorname {gcd}(d,q)=1\)
Multicomponent codes with maximum code distance
Pseudo-ovals in even characteristic and ovoidal Laguerre planes
On MPS construction of blocking sets in projective spaces: a generalization
Maximal partial spreads and translation nets of small deficiency
Open problems in finite projective spaces
Constructing minimal blocking sets using field reduction
Small maximal partial \(t\)-spreads in \(\mathrm{PG}(2t+1 , q)\)
Some self-blocking block designs
Blocking sets in \(\text{PG}(2,q^n)\) from cones of \(\text{PG}(2n,q)\)
Maximal partial spreads and the modular \(n\)-queen problem
Characterizing the line set of a Baer subspace
Maximal partial spreads and transversal-free translation nets
Anticode-based locally repairable codes with high availability
Cores and independence numbers of Grassmann graphs
The non-existence of certain large minimal blocking sets
MacWilliams extension theorem for MDS codes over a vector space alphabet
The minimum size of a finite subspace partition
The use of blocking sets in Galois geometries and in related research areas
Some applications of finite geometry for secure network coding
The geometric approach to the existence of some quaternary Griesmer codes
Locally recoverable codes correcting many erasures over small fields
Maximal partial spreads and the modular \(n\)-queen problem. II
Rédei blocking sets with two Rédei lines and quasigroups

This page was built for publication: Blocking sets and partial spreads in finite projective spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1246741)