It is known that $42$ is the largest size of a $6$-arc in the Desarguesian projective plane of order $8$. In this paper, we classify these $(42,6)_8$ arcs. Equivalently, we classify the smallest $3$-fold blocking sets in PG$(2,8)$, which have size $31$.
19 September 2008 in Designs, Codes and Cryptography
Using an exhaustive computer search, we prove that the number of inequivalent -arcs in PG is exactly 22. This generalizes a result of Barlotti (see Barlotti, A. Some Topics in Finite Geometrical Structures, 1965), who constructed the first such arc from a conic. Our classification result is based on the fact that arcs and linear codes are related, which enables us to apply an algorithm for classifying the associated linear codes instead. Related to this result, several infinite families of arcs and multiple blocking sets are constructed. Lastly, the relationship between these arcs and the Barlotti arc is explored using a construction that we call transitioning.