Characterization of \2(q+1)+2,2;t,q\- hypers in PG(t,q) (t 3,q 5) and its applications to error-correcting codes
The Griesmer bound for a linear (n,k)-code over GF(q) with minimum distance d has the form \(n\geq \sum^{k-1}_{\ell =0}\lceil d/q^{\ell}\rceil,\) where \(\lceil x\rceil\) denotes the smallest integer \(\geq x\). Among the linear codes with fixed parameters k, d and q it is of interest to determine those which satisfy the Griesmer bound with equality and have thus minimum length n. Earlier work by the former author proved that the solution of the above problem for a wide range of parameters amounts to the determination of certain configurations of points in a projective space called min\(\cdot hypers\). A non-empty set F of points of a projective space PG(t,q) with \(t\geq 2\) is said to be an \(\{\) \(| F|,m;t,q\}\)-min\(\cdot hyper\) for a non-negative integer m if it meets each hyperplane of PG(t,q) in at least m points and there exists one hyperplane of PG(t,q) having exactly m points in common with F. The former paper characterizes all \(\{2(q+1)+2,2;t,q\}\)-min\(\cdot hypers\) for any integer \(t\geq 3\) nd any prime power \(q\geq 5:\) they consist namely of two skew lines and two further points outside them. Given a prime power q define \(v_{\ell}:=(q^{\ell}-1)/(q-1)\) for each non-negative integer \(\ell\). Let t, q and \(\epsilon\) be integers with \(1\leq \mu <t,\) \(0\leq \epsilon <\sqrt{q}.\) The latter paper (see the paper below) characterizes all \(\{v_{\mu +1},v_ 1;t,q\}\)-min\(\cdot hypers:\) they consist namely of a \(\mu\)-dimensional subspace and \(\epsilon\) points not on it (if instead q is a square, \(\mu =1\) and \(\sqrt{q}\leq \epsilon <q\) then \(\{v_{\mu +1},v_ 1;t,q\}\)-min\(\cdot hypers\) exist which are not of the described type: for \(t=2\) one can simply take a Baer subplane of PG(2,q)). The two papers are quite similar in the structure, the proofs have to distinguish many cases, but they involve basically only counting arguments in finite projective spaces. Characterizations of all linear codes satisfying the Griesmer bound with equality are thus obtained in the former paper for \(k\geq 3\), \(d=q^{k- 1}-(2+2q),\) \(q\geq 5\) and in the latter one for \(1\leq \mu <k-1,\) \(d=q^{k-1}-(\epsilon +q^{\mu})\) and \(0\leq \epsilon <\sqrt{q}.\)
- 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
- scientific article; zbMATH DE number 791219
- 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
- scientific article; zbMATH DE number 880154
- A Bound for Error-Correcting Codes
- A characterization of codes meeting the Griesmer bound
- A note on the Griesmer bound (Corresp.)
- Algebraically punctured cyclic 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
- Construction of Optimal Codes and Optimal Fractional Factorial Designs Using Linear Programming
- Construction of optimal linear codes using flats and spreads in a finite projective geometry
- scientific article; zbMATH DE number 3166657 (Why is no real title available?)
- scientific article; zbMATH DE number 3765799 (Why is no real title available?)
- scientific article; zbMATH DE number 3499621 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- On a geometrical method of construction of maximal t-linearly independent sets
- On linear codes which attain the Solomon-Stiffler bound
- On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound
- Multiple blocking sets in finite projective spaces and improvements to the Griesmer bound for linear 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 \(\{v_{\mu +1}+2v_{\mu},v_{\mu}+2v_{\mu - 1};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes
- A characterization of \(\{v_{\mu +1}+\epsilon,v_{\mu};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes and factorial designs
- 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 \(\{2v_{\alpha{}+1}+v_{\gamma{}+1},2v_ \alpha{}+v_ \gamma{};k-1,3\}\)-minihypers and some \((n,k,3^{k-1}- 2\cdot{}3^ \alpha{}-3^ \gamma{};3)\)-codes \((k\geq{}3,\;0 \leq{}\alpha{}< \gamma{}< k-1)\) meeting the Griesmer bound
- A characterization of some \(\{v_ 2+2v_ 3,v_ 1+2v_ 2;k-1,3\}\)-minihypers and some \((v_ k-30,k,3^{k-1}-21;3)\)-codes meeting the Griesmer bound
- 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
- 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
- Characterization of \(\{2(q+1) + 2, 2; t, q\}\)-minihypers in \(PG(t,q) (t\geqslant 3, q\in \{3,4\})\)
- A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
- On the smallest size of an almost complete subset of a conic in \(\mathrm{PG}(2, q)\) and extendability of Reed-Solomon codes
- scientific article; zbMATH DE number 125900 (Why is no real title available?)
- A characterization of some minihypers in a finite projective geometry PG(t,4)
- Some optimal codes from algebraic geometry and their covering radii
This page was built for publication: 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124583)
