Blocking sets and partial spreads in finite projective spaces
From MaRDI portal
(Redirected from Publication:1246741)
Cited in
(40)- Rédei blocking sets with two Rédei lines and quasigroups
- 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)\)
- On the extendability of quasidivisible Griesmer arcs
- scientific article; zbMATH DE number 7666857 (Why is no real title available?)
- 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
- Partial spreads over \({\mathbb{Z}}_ q\)
- On sets of type \((m,m+q)_2\) in \(\mathrm{PG}(3,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\)
- Pseudo-ovals in even characteristic and ovoidal Laguerre planes
- Multicomponent codes with maximum code distance
- 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
- Maximal partial spreads and the modular \(n\)-queen problem
- Blocking sets in \(\text{PG}(2,q^n)\) from cones of \(\text{PG}(2n,q)\)
- 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
- MacWilliams extension theorem for MDS codes over a vector space alphabet
- The minimum size of a finite subspace partition
- The non-existence of certain large minimal blocking sets
- 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
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)