A survey of recent works with respect to a characterization of an (n,k,d;q)-code meeting the Griesmer bound using a min\(\cdot hyper\) in a finite projective geometry (Q1262869)

Let V(n;q) be an n-dimensional vector space over a Galois field GF(q) where \(n>0\). A k-dimensional subspace C of V(n;q) is said to be an (n,k,d;q)-code if the minimum (Hamming) distance of the code C is equal to d where \(n>k\geq 3\) and \(d\geq 1\). It is well known the following Griesmer bound: if there exists an (n,k,d;q)-code for given integers k, d and q, then \(n\geq \sum^{k-1}_{\ell =0}[\frac{d}{q^{\ell}}]\) where [x] denotes the smallest integer \(\geq x\). The purpose of this paper is to survey recent works with respect to a characterization of all (n,k,d;q)- codes meeting the Griesmer bound in the case \(1\leq d\leq q^{k-1}-q\) by the concept of a min\(\cdot hyper\) in a finite projective geometry. This concept has been introduced by \textit{N. Hamada} and \textit{F. Tamari} [J. Comb. Theory, Ser. A 25, 14-28 (1978; Zbl 0389.05022)].