An Algorithm For Constructing Blocking Sets For Projective Planes

A family of sets is said to have property B(s) if there is a set, referred to as a blocking set, whose intersection with each member of the family is a proper subset of that blocking set and contains fewer than a elements. A finite projective plane is a construction satisfying the two conditions that any two lines meet in a unique point and any two points are on a unique line. In this paper, the authors develop an algorithm of complexity O(n(3)) for constructing a blocking set for a projective plane of order n.