A characterization of some \(\{3v_{\mu+ 1}, 3v_ \mu; k-1, q\}\)-minihypers and some \([n, k, q^{k-1}- 3q^ \mu; q]\)-codes \((k\geq 3\), \(q\geq 5\), \(1\leq \mu< k-1)\) meeting the Griesmer bound (Q1903718): Difference between revisions

The authors characterize the codes with the parameters given in the title which meet the Griesmer bound. By a fundamental paper of \textit{N. Hamada} [``Characterization of minihypers in a finite projective geometry and its applications to error correcting codes'', Bull. Osaka Women's Univ. 24, 1-24 (1987)], this problem may be translated into a problem in Galois geometry, i.e. into a characterization problem for certain corresponding ``minihypers''. Using this connection, it is shown that the corresponding codes have a generator matrix whose columns correspond to all points in \(\text{PG} (k-1, q)\) except for those which lie in a disjoint union of three \(\mu\)-flats (in particular, this requires \(k\geq 2\mu+2)\).