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

DOI10.1007/S10623-011-9541-XMaRDI QIDQ766239zbMATH OpenOpenAlexFDO

Authors M. L. Aggarwal, Andreas Klein, Leo Storme

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) Combinatorial structures in finite projective spaces (51E20) Blocking sets, ovals, (k)-arcs (51E21)

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

Cites work

• scientific article; zbMATH DE number 3917102 (Why is no real title available?)
• 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
• The classification of the smallest nontrivial blocking sets in \(PG(n,2)\)

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)