Classification of the \((n,3)\)-arcs in PG\((2,7)\) (Q1882455)

The authors classify all \((n,3)\)-arcs in PG\((2,7)\). These are sets of points intersecting every line in at most three points, and intersecting at least one line in exactly three points. This classification is equivalent to the classification of the \([n,3,n-3]\) NMDS (Near Maximum Distance Separable) codes over GF\((7)\). This classification is also used to show that the maximal length of an NMDS code of dimension 4 over GF\((7)\) is 14, that there are three non-equivalent \([14,4,10]\) codes over GF\((7)\), and that the maximal length of an NMDS code of dimension 5 over GF\((7)\) is equal to 13.