A geometric approach to classifying Griesmer codes (Q2384039): Difference between revisions

The subject matter of this paper concerns the classification of linear codes \([n,k,d]_q\) such that \(n\) equals the Griesmer bound \(g_q(k,d)\). The cases \(k=1,2\) were already studied by R. Hill (Cirencester, 1989). The cases \(k=3,4,5\) and small length was treated in [\textit{M. van Eupen, P. Lisonĕk}, Des. Codes Cryptography 10, No.~1, 63--84 (1997; Zbl 0869.94031)]. The authors investigate the case \(k=3\) and \(q\) a divisor of \(d\). Since such a code can be identify with an \((n,n-d)\)-arc in \(PG(2,q)\) the approach of the subject is treated via structures of Finite Geometry, namely maximal arcs and minihypers.