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

Authors

Manohar L. Aggarwal, University of MemphisFollow
Andreas Klein, Universiteit Gent
Leo Storme, Universiteit Gent

Abstract

We classify the smallest two fold blocking sets with respect to the (n-k)-spaces in PG(n, 2).We show that they either consist of two disjoint k-dimensional subspaces or are equal to a (k + 1)-dimensional space minus one point. © Springer Science+Business Media, LLC 2011.

Publication Title

Designs, Codes, and Cryptography

Recommended Citation

Aggarwal, M., Klein, A., & Storme, L. (2012). The characterisation of the smallest two fold blocking sets in PG(n, 2). Designs, Codes, and Cryptography, 63 (2), 149-157. https://doi.org/10.1007/s10623-011-9541-x