The characterisation of the smallest two fold blocking sets in PG(n, 2)

DOI10.1007/S10623-011-9541-XzbMATH Open1237.05028OpenAlexW2012186776MaRDI QIDQ766239FDOQ766239

Andreas Klein, Leo Storme, M. L. Aggarwal

Publication date: 23 March 2012

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1854/LU-2140226

Recommendations

• The classification of the smallest nontrivial blocking sets in \(PG(n,2)\)
• scientific article; zbMATH DE number 7666857
• On 1-blocking sets in \(PG(n,q), n\geq 3\)
• A characterization of multiple \((n-k)\)-blocking sets in projective spaces of square order
• Small blocking sets in higher dimensions

zbMATH Keywords

codimensional \(k\) spaces

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20) Blocking sets, ovals, (k)-arcs (51E21)

Cites Work

• A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
• Title not available (Why is that?)
• The classification of the smallest nontrivial blocking sets in \(PG(n,2)\)
• A characterization of codes meeting the Griesmer bound

Cited In (1)

• Minimal Blocking Sets inPG(n, 2) and Covering Groups by Subgroups

This page was built for publication: The characterisation of the smallest two fold blocking sets in PG\((n, 2)\)

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