Construction of some optimal ternary linear codes and the uniqueness of \([294, 6, 195; 3]\)-codes meeting the Griesmer bound (Q1904532)

If \(C\) is any linear code with length \(n\), dimension \(k\), and minimum Hamming distance \(d\) over the Galois field \(GF(q)\) (or \([n,k, d;q]\)-code), the Griesmer bound states that \(n\geq \sum^{k-1}_{i=0} \lceil d/q^i \rceil\). Let \(n_q (k,d)\) denote the smallest value of \(n\) for which there exists an \([n,k, d;q]\)-code. Let \(F\) be a set of \(f\) points in a finite projective geometry \(PG (t,q)\), where \(t\geq 2\) and \(f\geq 1\). If \(|F\cap H|\geq m\) for every hyperplane \(H\) in \(PG (t,q)\) and \(|F\cap H_0 |=m\) for some hyperplane \(H_0\) in \(PG (t,q)\), then \(F\) is called an \(\{f, m;t, q\}\)-minihyper. It is known [\textit{N. Hamada}, A survey of recent work on characterization of minihypers in \(PG (t,q)\) and nonbinary linear codes meeting the Griesmer bound, J. Comb. Inf. Syst. Sci. 18, 161-191 (1993)] that \[ \begin{aligned} n_3 (6,195) &\in \{294, 295\}, \quad n_3 (6, 194) \in \{293, 294\}, \quad n_3 (6, 193) \in \{292, 293\}, \\ n_3 (6, 192) &\in \{290, 291\}, \quad n_3 (6, 191) \in \{289, 290\}, \quad n_3 (6, 165) \in \{250, 251\}; \end{aligned} \tag{1} \] (2) there is a one-to-one correspondence between the set of all nonequivalent \([294, 6, 195; 3]\)-codes meeting the Griesmer bound and the set of all \(\{\nu_2+ 2\nu_3+ \nu_4, \nu_1+ 2\nu_2+ \nu_3; 5, 3\}\)-minihypers, where \(\nu_i= (3^i- 1)/2\) for any integer \(i\geq 0\). In this paper the authors show that \[ \begin{aligned} n_3 (6, 195) &= 294, \quad n_3 (6, 194) = 293, \quad n_3 (6, 193) = 292, \\ n_3 (6, 192) &= 290, \quad n_3 (6,191) = 289, \quad n_3 (6, 165) = 250; \end{aligned} \tag{1} \] (2) a \([294, 6, 195; 3]\)-code is unique up to equivalence using a characterization of the corresponding \(\{\nu_2+ 2\nu_3+ \nu_4, \nu_1+ 2\nu_2+ \nu_3; 5, 3\}\)-minihypers.