Minihypers and linear codes meeting the Griesmer bound: Improvements to results of Hamada, Helleseth and Maekawa
type: Item
instance of: scholarly article
title: Minihypers and linear codes meeting the Griesmer bound: Improvements to results of Hamada, Helleseth and Maekawa
zbMATH Open document ID: 0999.94046
DOI: 10.1023/A:1013852330818
published in: Designs, Codes and Cryptography
publication date: 2002-05-28T00:00:00Z
review text: An \(\{f,m;t,q\}\)-minihyper \(F\) is a set of \(f\) points in PG\((t,q)\), where \(t\geq 2\) and \(f\geq 1\), and \(|F\cap H|\geq m\) for every hyperplane \(H\) in PG\((t,q)\) and \(|F\cap H|= m\) for at least one hyperplane \(H\). Minihypers are important in order to characterize codes meeting the Griesmer bound. It is known [\textit{N. Hamada} and \textit{T. Helleseth}, Math. Jap. 38, 925-939 (1993; Zbl 0786.05016); and \textit{N. Hamada} and \textit{T. Maekawa}, Math. Jap. 46, 241-252 (1997; Zbl 0891.94010)] that any \(\{\sum^{t-1}_{i=0}\varepsilon_iv_{i+1},\sum^{t-1}_{i=0}\varepsilon_iv_i;t,q\}\)-minihyper with \(\sum^{t-1}_{i=0}\varepsilon_i = h\) and \((h-1)^2<q\) is the disjoint union of \(\varepsilon_0\) points, \(\varepsilon_1\) lines, \dots, \(\varepsilon_{t-1}(t - 1)\)-dimensional subspaces, where \(v_i = (q^i-1)/(q - 1)\) for any integer \(i\geq 0\). The authors improve the above results by increasing the upper bound on \(h\): (1) for \(q = p^f\), \(p\) prime, \(p > 3\), \(q\) non-square, to \(h \leq q^{6/9}/(1 + q^{1/9})\), (2) for \(q = p^f\) non-square, \(p = 2,3\), to \(h\leq 2^{-1/3}q^{5/9}\), (3) for \(q = p^f\) square, \(p = 2,3\), to \(h\leq \min\{2\sqrt{q} -1,2^{-1/3}q^{5/9}\}\), and (4) for \(q = p^f\) square, \(p\) prime, \(p > 3\), to \(h \leq \min\{2\sqrt q-1, q^{6/9}/(1 + q^{1/9})\}\). When \(q\) is a non-square, the minihyper is the disjoint union of subspaces. When \(q\) is a square, the minihyper is either the disjoint union of subspaces or the disjoint union of subspaces and a subgeometry PG\((l,\sqrt{q})\) of PG\((t,q)\).
Mathematics Subject Classification ID: 94B65
Mathematics Subject Classification ID: 51E20
Mathematics Subject Classification ID: 05B25
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 94B25
zbMATH DE Number: 1746297
zbMATH Keywords: minihypers
zbMATH Keywords: linear codes
zbMATH Keywords: projective spaces
zbMATH Keywords: Griesmer bound
author: Sandy Ferret
author: Leo Storme
reviewed by: Tor Helleseth
MaRDI profile type: Publication
full work available at URL: a:1013852330818
OpenAlex ID: W1594612049
Recommended article: Q4314362
Recommended article: A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
Recommended article: Characterization of \(\{2(q+1) + 2, 2; t, q\}\)-minihypers in \(PG(t,q) (t\geqslant 3, q\in \{3,4\})\)
Recommended article: A characterization of some minihypers and its application to linear codes
Recommended article: Q4664669
Recommended article: Q1182872
Recommended article: A characterization of some minihypers in a finite projective geometry PG(t,4)
Recommended article: Q4876796
Recommended article: Construction of some optimal ternary linear codes and the uniqueness of \([294, 6, 195; 3]\)-codes meeting the Griesmer bound
Recommended article: Characterization of \(\{2(q+1)+2,2;t,q\}\)-\(\min \cdot hypers\) in PG(t,q) (t\(\geq 3,q\geq 5)\) and its applications to error-correcting codes
description: scientific article; zbMATH DE number 1746297