A Computer Search for Minimal Blocking Sets In \(PG(2,q)\)

Jennie Danielsson1
1Jennie Danielsson, David Bagares Gata 6, 111 38 Stockholm, Sweden

Abstract

We made a computer search for minimal blocking sets in the projective geometry \(\text{PG}(2,11)\), and found \(30,000\), of which only two nontrivial blocking sets had the possibility of being isomorphic.