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 (Q1182872): Difference between revisions

Let \(F\) be an \(f\)-set of points in the projective space \(PG(t,q)\). If \(F\) intersects each hyperplane in at least \(m\) points, with equality for at least one hyperplane, one calls \(F\) an \(\{f,m;t,q\}\)-minihyper. The importance of these objects for coding theory is due to the existence of a one-to-one correspondence between \((n,k,d;q)\)-codes meeting the Griesmer bound and \(\{f,m;k-1,q\}\)-minihypers. In the paper under review, all \(\{2v_{\alpha+1}+2v_{\beta+1},2v_ \alpha+2v_ \beta;t,q\}\)- minihypers are characterized, where \(\alpha\) and \(\beta\) are integers with \(0\leq \alpha<\beta < t\), \(t\geq 2\), \(q\geq 5\), and \(v_ m=(q^ m- 1)/(q-1)\) for every integer \(m\geq 0\): Theorem. If \(t\leq 2\beta\), there is no such minihyper. If \(t>2\beta\), the minihypers in question are exactly the unions of two-flats and two-flats which are mutually disjoint. As an application, the corresponding codes meeting the Griesmer bound are characterized.