On the nonexistence of quaternary \([51, 4, 37]\) codes (Q1908798)

The authors prove the nonexistence of quaternary linear \([51,4, 37]\)-codes. If \(n_q (k,d)\) denotes the minimum possible length of a \(q\)-ary linear code of dimension \(k\) and minimum distance \(d\), the values of \(n_4 (4,d)\) were known for all but two values of \(d\) [cf. \textit{P. P. Greenough} and \textit{R. Hill}, Discrete Math. 125, 187--199 (1994; Zbl 0792.94005) and \textit{R. Hill} and \textit{I. Landgev}, Inst. Math. Appl. Conf. Ser., New Ser. 59, 85--98 (1996; Zbl 0873.94021)]. The present paper solves the remaining two cases and shows \(n_4 (4, 37)= 52\) and \(n_4 (4, 38)= 53\). The proof is geometrical and uses results about certain point sets of \(\mathrm{PG}(2,4)\).