A characterization of some \(\{2v_{\alpha{}+1}+v_{\gamma{}+1},2v_ \alpha{}+v_ \gamma{};k-1,3\}\)-minihypers and some \((n,k,3^{k-1}- 2\cdot{}3^ \alpha{}-3^ \gamma{};3)\)-codes \((k\geq{}3,\;0 \leq{}\alpha{}< \gamma{}< k-1)\) meeting the Griesmer bound (Q1197005)

If \(C\) is a linear code of length \(n\), dimension \(k\), and minimum distance \(d\) over the alphabet \(GF(q)\), the Griesmer bound states that \(n\geq \sum^{k-1}_{i=0} \lceil d/q^ i \rceil\). In the paper under review all \((n,k,d)\)-codes over \(GF(3)\) meeting the Griesmer bound are characterized in the case \(k\geq 3\) and \(d=3^{k-1}-2\cdot 4^ \alpha- 3^ \gamma\), where \(\alpha\) and \(\gamma\) are integers with \(0\leq \alpha < \gamma <k-1\) and \(\gamma \neq \alpha+1\). The proof is based on the characterization of a certain family of minihypers, where an \(\{f,m; t,q\}\)-minihyper is a set \(F\) of \(f\) points in the projective geometry \(PG(t,q)\) such that \(| F\cap H| \geq m\) for all hyperplanes \(H\) of \(PG(t,q)\) and \(| F\cap H| =m\) for some hyperplane \(H\). The notion of a minihyper, which is a generalization of blocking sets, was first introduced by the first author and \textit{F. Tamari} in [J. Combinat. Theory, Ser. A 25, 14-28 (1978; Zbl 0389.05022)].