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

DOI10.1007/S10623-011-9541-XzbMath1237.05028OpenAlexW2012186776MaRDI QIDQ766239

Andreas G. Klein, Storme, L., Manohar 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

zbMATH Keywords

codimensional \(k\) spaces

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• The classification of the smallest nontrivial blocking sets in \(PG(n,2)\)
• A characterization of codes meeting the Griesmer bound
• A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes

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