A characterization of some \2v_+1+v_+1,2v_ +v_ ;k-1,3\-minihypers and some (n,k,3ᵏ-1- 23^ -3^ ;3)-codes (k3,\;0 < < k-1) meeting the Griesmer bound
If \(C\) is a linear code of length \(n\), dimension \(k\), and minimum distance \(d\) over the alphabet \(GF(q)\), the Griesmer bound states that \(n\geq \sum^{k-1}_{i=0} \lceil d/q^ i \rceil\). In the paper under review all \((n,k,d)\)-codes over \(GF(3)\) meeting the Griesmer bound are characterized in the case \(k\geq 3\) and \(d=3^{k-1}-2\cdot 4^ \alpha- 3^ \gamma\), where \(\alpha\) and \(\gamma\) are integers with \(0\leq \alpha < \gamma <k-1\) and \(\gamma \neq \alpha+1\). The proof is based on the characterization of a certain family of minihypers, where an \(\{f,m; t,q\}\)-minihyper is a set \(F\) of \(f\) points in the projective geometry \(PG(t,q)\) such that \(| F\cap H| \geq m\) for all hyperplanes \(H\) of \(PG(t,q)\) and \(| F\cap H| =m\) for some hyperplane \(H\). The notion of a minihyper, which is a generalization of blocking sets, was first introduced by the first author and \textit{F. Tamari} in [J. Combinat. Theory, Ser. A 25, 14-28 (1978; Zbl 0389.05022)].
- scientific article; zbMATH DE number 691471
- A characterization of some \(\{3v_{\mu+ 1}, 3v_ \mu; k-1, q\}\)-minihypers and some \([n, k, q^{k-1}- 3q^ \mu; q]\)-codes \((k\geq 3\), \(q\geq 5\), \(1\leq \mu< k-1)\) meeting the Griesmer bound
- scientific article; zbMATH DE number 791219
- scientific article; zbMATH DE number 39945
- A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
- A Bound for 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 codes meeting the Griesmer bound
- A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
- A characterization of some \(\{3v_{\mu+ 1}, 3v_ \mu; k-1, q\}\)-minihypers and some \([n, k, q^{k-1}- 3q^ \mu; q]\)-codes \((k\geq 3\), \(q\geq 5\), \(1\leq \mu< k-1)\) meeting the Griesmer bound
- A characterization of some minihypers in a finite projective geometry PG(t,4)
- A note on the construction of optimal linear codes
- Algebraically punctured cyclic codes
- Arcs and blocking sets. II
- Caps and 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
- Construction of optimal linear codes using flats and spreads in a finite projective geometry
- scientific article; zbMATH DE number 4083640 (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
- 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\)
- A characterization of some \(\{ 3v_ 1+v_ 3,3v_ 0+v_ 2; 3,3\}\)-minihypers and its applications to error-correcting codes
- A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
- A construction of some \([n,k,d;q]\)-codes meeting the Griesmer bound
- A characterization of some \(\{3v_{\mu+ 1}, 3v_ \mu; k-1, q\}\)-minihypers and some \([n, k, q^{k-1}- 3q^ \mu; q]\)-codes \((k\geq 3\), \(q\geq 5\), \(1\leq \mu< k-1)\) meeting the Griesmer bound
- The nonexistence of \([71,5,46;3]\)-codes
- Optimal fractional factorial plans using minihypers
- scientific article; zbMATH DE number 39945 (Why is no real title available?)
- scientific article; zbMATH DE number 691471 (Why is no real title available?)
- scientific article; zbMATH DE number 2154120 (Why is no real title available?)
- scientific article; zbMATH DE number 791219 (Why is no real title available?)
- scientific article; zbMATH DE number 880154 (Why is no real title available?)
- Arcs, minihypers, and the classification of three-dimensional Griesmer codes
- Affine blocking sets, three-dimensional codes and the Griesmer bound
This page was built for publication: 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197005)
