Blocking sets and partial spreads in finite projective spaces

From MaRDI portal
Publication:1246741

DOI10.1007/BF00181559zbMath0377.50007OpenAlexW1975604075MaRDI QIDQ1246741

Albrecht Beutelspacher

Publication date: 1980

Published in: Geometriae Dedicata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00181559



Related Items

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