scientific article; zbMATH DE number 7666857
From MaRDI portal
Publication:5883641
Recommendations
Cites work
- A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
- Blocking Sets in Finite Projective Planes
- Blocking sets and partial spreads in finite projective spaces
- Degree 2 Boolean functions on Grassmann graphs
- Finite geometries. Translated from the Hungarian
- How many \(s\)-subspaces must miss a point set in \(\mathrm{PG}(d, q)\)
- Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective Spaces
Cited in
(7)- Partial covers of \(\mathrm{PG}(n, q)\)
- Blocking subspaces by lines in \(PG(n,q)\)
- On a particular class of minihypers and its applications. I: The result for general q
- The characterisation of the smallest two fold blocking sets in PG\((n, 2)\)
- Constructing minimal blocking sets using field reduction
- Blocking subspaces with points and hyperplanes
- Blocking sets in the complement of hyperplane arrangements in projective space
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5883641)