Characterization of \2(q+1) + 2, 2; t, q\-minihypers in PG(t,q) (t 3, q \3,4\)
An \(\{f,m;t,q\}\)-minihyper is a set \(F\) of \(f\) points in \(PG(t,q)\) such that \(F\) meets every hyperplane in at least \(m\) points and at least one hyperplane in exactly \(m\) points. Minihypers have connections with codes and the problem of characterizing all \([n,k,d,q]\)-codes (such a code is a \(k\)-dimensional subspace of an \(n\)-dimensional vector space over \(GF(q)\) such that every nonzero vector has Hamming weight at least \(d)\) meeting the Griesmer bound, i.e. such that \(n=\sum^{k-1}_{i=0}\left[{d\over q^ i}\right]\), lead the authors to the problem of characterizing the minihypers in the title. Under other restrictions, a characterization exists already (e.g. \(t\geq 3\) and \(q\geq 5\) was done by the first author and \textit{M. Deza} [Discrete Math. 71, No. 3, 219-231 (1988; Zbl 0678.94010)]). The main result of the paper under review is the fact that there exist no irreducible \(\{12,2;t,4\}\)-minihypers and that there exists exactly one class of irreducible \(\{10,2;t,3\}\)-minihypers. Irreducible means that the minihyper is not a union of at least two disjoint minihypers.
- A characterization of \(\{ 2\upsilon{}_{\alpha{}+1}+2\upsilon{}_{\beta{}+1},2\upsilon_ \alpha{}+2\upsilon{}_ \beta{} ;t,q\}\)-minihypers in PG\((t,q)(t\geq 2,q\geq 5\) and \(0\leq\alpha{}<\beta{}<t)\) and its applications to error- correcting codes
- A characterization of some minihypers in a finite projective geometry PG(t,4)
- Minihypers and linear codes meeting the Griesmer bound: Improvements to results of Hamada, Helleseth and Maekawa
- A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
- scientific article; zbMATH DE number 691471
- Construction of some optimal ternary linear codes and the uniqueness of \([294, 6, 195; 3]\)-codes meeting the Griesmer bound
- A characterization of some minihypers and its application to linear codes
- 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
- scientific article; zbMATH DE number 933182
- scientific article; zbMATH DE number 874272
- A Bound for Error-Correcting Codes
- Characterization of \(\{(q+1)+2,1;t,q\}-\min \cdot hypers\) and \(\{2(q+1)+2,2;2,q\}-\min \cdot hypers\) in a finite projective geometry
- 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
- Classification of Griesmer codes and dual transform
- On the nonexistence of some quaternary linear codes meeting the Griesmer bound
- Uniqueness of \([87,5,57; 3]\)-codes and the nonexistence of \([258,6,171; 3]\)-codes
- A characterization of some \(\{ 3v_ 2+v_ 3,3v_ 1+v_ 2; 3,3\}\)-minihypers and some \([15,4,9; 3]\)-codes with \(B_ 2=0\)
- Minihypers and linear codes meeting the Griesmer bound: Improvements to results of Hamada, Helleseth and Maekawa
- A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
- scientific article; zbMATH DE number 125900 (Why is no real title available?)
- A study of \((xv_t, xv_{t-1})\)-minihypers in \(\mathrm{PG}(t,q)\)
- Characterization of some minihypers in \(\mathrm{PG}(4,3)\)
- A characterization of some minihypers in a finite projective geometry PG(t,4)
- A study of \((x(q + 1), x; 2, q)\)-minihypers
This page was built for publication: Characterization of \(\{2(q+1) + 2, 2; t, q\}\)-minihypers in \(PG(t,q) (t\geqslant 3, q\in \{3,4\})\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801697)
