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

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.