The classification of the smallest nontrivial blocking sets in \(PG(n,2)\)
From MaRDI portal
Publication:855848
DOI10.1016/j.jcta.2005.11.002zbMath1117.51011OpenAlexW1998187090MaRDI QIDQ855848
Publication date: 7 December 2006
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2005.11.002
Related Items (8)
The Use of Blocking Sets in Galois Geometries and in Related Research Areas ⋮ Stability and exact Turán numbers for matroids ⋮ On the non-trivial minimal blocking sets in binary projective spaces ⋮ A geometric version of the Andrásfai-Erdős-Sós theorem ⋮ Dense binary \(\mathrm{PG}(t-1,2)\)-free matroids have critical number \(t-1\) or \(t\) ⋮ Open problems in finite projective spaces ⋮ Minimal Blocking Sets inPG(n, 2) and Covering Groups by Subgroups ⋮ The characterisation of the smallest two fold blocking sets in PG\((n, 2)\)
Cites Work
- Unnamed Item
- Unnamed Item
- On small blocking sets and their linearity
- Blocking sets and partial spreads in finite projective spaces
- On the size of a blocking set in \(\text{PG}(2,p)\)
- Small minimal blocking sets in \(\text{PG}(2,q^3)\)
- Small blocking sets in \(PG(2,p^3)\)
- Small minimal blocking sets and complete \(k\)-arcs in PG\((2,p^3)\)
- A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
- Baer subplanes and blocking sets
This page was built for publication: The classification of the smallest nontrivial blocking sets in \(PG(n,2)\)