A characterization of some [n,k,d;q]-codes meeting the Griesmer bound using a minihyper in a finite projective geometry

DOI10.1016/0012-365X(93)90404-HzbMATH Open0770.94006MaRDI QIDQ1802134FDOQ1802134

Authors: Noboru Hamada 

Publication date: 13 September 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 4083640
• 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
• scientific article; zbMATH DE number 933182
• 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
• scientific article; zbMATH DE number 691471

zbMATH Keywords

Griesmer boundfinite projective geometryhyperplanesminihyper

Mathematics Subject Classification ID

Combinatorial structures in finite projective spaces (51E20) Linear codes (general theory) (94B05) Bounds on codes (94B65)

Cites Work

• Error detecting and error correcting codes
• Orthogonal Arrays of Index Unity
• On a class of error correcting binary group codes
• Title not available (Why is that?)
• Algebraically punctured cyclic codes
• Title not available (Why is that?)
• A Bound for Error-Correcting Codes
• A note on the Griesmer bound (Corresp.)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Nonexistence of Perfect Codes over Finite Fields
• On a geometrical method of construction of maximal t-linearly independent sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the uniqueness of the Golay codes
• On a Bound Useful in the Theory of Factorial Designs and Error Correcting Codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some maximal arcs in finite projective planes
• Title not available (Why is that?)
• Caps and codes
• Title not available (Why is that?)
• New bounds on binary linear codes of dimension eight (Corresp.)
• Some results concerning \(\{(q+1)(n-1);\;n\}\)-arcs and \(\{(q+1)\;(n-1)+1;\;n\}\)-arcs in finite projective planes of order \(q\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lower bounds on \(m_t(r,s)\)
• The non-classical 10-arc of PG(4,9)
• A vector-space packing problem
• A characterization of codes meeting the Griesmer bound
• On the uniqueness of \((q+1)_ 4\)-arcs of \(PG(4,q),q=2^ h,h\vee\)
• A note on the construction of optimal linear codes
• On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound
• Construction of Optimal Codes and Optimal Fractional Factorial Designs Using Linear Programming
• Title not available (Why is that?)
• On linear codes which attain the Solomon-Stiffler bound
• Construction of optimal linear codes using flats and spreads in a finite projective geometry
• Arcs and blocking sets. II
• 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
• 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
• 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 \(\{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
• Title not available (Why is that?)
• A characterization of some minihypers in a finite projective geometry PG(t,4)
• Further results on error correcting binary group codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• New constructions of codes meeting the Griesmer bound
• A new class of codes meeting the Griesmer bound
• Characterization of \(\{v_{\mu +1}+2v_{\mu},v_{\mu}+2v_{\mu - 1};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes
• Title not available (Why is that?)
• 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 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
• Title not available (Why is that?)
• On maximal \(t\)-linearly independent sets
• Maximal sets of points in finite projective space, no t-linearly dependent
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (63)

• Characterization of some minihypers in \(\mathrm{PG}(4,3)\)
• New upper bounds and constructions of multi-erasure locally recoverable codes
• Binary and ternary LCD codes from projective spaces
• Title not available (Why is that?)
• Some new constructions of optimal linear codes and alphabet-optimal \((r, \delta)\)-locally repairable codes
• Optimal fractional factorial plans using minihypers
• On the minimum length of linear codes of dimension 5
• Locally two-weight property for linear codes and its application
• Nonexistence of some ternary linear codes with minimum weight \(-2\) modulo 9
• On optimal non-projective ternary linear codes
• A classification result on weighted \(\{\delta v_{\mu +1},\delta v_{\mu};N,p^{3}\}\)-minihypers
• On weighted minihypers in finite projective spaces of square order
• On optimal linear codes over \(\mathbb F_5\)
• On the minimum length of ternary linear codes
• 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 \(\{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 ternary [97, 6, 63] codes
• On the minimum length of some linear codes of dimension 5
• A new extension theorem for 3-weight modulo \(q\) linear codes over \({\mathbb{F}_q}\)
• Tight sets, weighted \(m\)-covers, weighted \(m\)-ovoids, and minihypers
• Extension theorems for linear codes over finite fields
• Extendability of 3-weight (mod \(q\)) linear codes over \(\mathbb F_q\)
• The packing problem in statistics, coding theory and finite projective spaces
• Uniqueness of \([87,5,57; 3]\)-codes and the nonexistence of \([258,6,171; 3]\)-codes
• A study of \((x(q + 1), x; 2, q)\)-minihypers
• On codes meeting the Griesmer bound.
• Minimal covers of \(Q^+(2n+1,q)\) by \((n-1)\)-dimensional subspaces
• On a particular class of minihypers and its applications. II: Improvements for \(q\) square
• The nonexistence of \([71,5,46;3]\)-codes
• On the minimum length of quaternary linear codes of dimension five
• The nonexistence of ternary [79, 6, 51] codes
• On optimal linear codes of dimension 4
• A new class of nonbinary codes meeting the Griesmer bound
• On a particular class of minihypers and its applications. III: Applications
• Projective codes meeting the Griesmer bound
• 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\)
• Title not available (Why is that?)
• Minihypers and linear codes meeting the Griesmer bound: Improvements to results of Hamada, Helleseth and Maekawa
• The non-existence of Griesmer codes with parameters close to codes of Belov type
• A weighted version of a result of Hamada on minihypers and on linear codes meeting the Griesmer bound
• Multiple blocking sets in finite projective spaces and improvements to the Griesmer bound for linear codes
• A class of optimal linear codes of length one above the Griesmer bound
• Characterization results on arbitrary non-weighted minihypers and on linear codes meeting the Griesmer bound
• A new extension theorem for linear codes
• Title not available (Why is that?)
• Non-existence of some 4-dimensional Griesmer codes over finite fields
• 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 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
• On the minimum size of some minihypers and related linear codes
• Nonexistence of linear codes meeting the Griesmer bound
• 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 \(\{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
• Arcs, blocking sets, and minihypers
• A new extension theorem for ternary linear codes and its application
• A characterization of some minihypers in a finite projective geometry PG(t,4)
• On the nonexistence of some quaternary linear codes meeting the Griesmer bound
• On the minimum length of linear codes over the field of 9 elements
• New sufficient conditions for the extendability of quaternary linear codes
• Nonexistence of \([n,5,d]_q\) codes attaining the Griesmer bound for \(q^4-2q^2-2q+1\leq d\leq q^4-2q^2-q\).
• 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
• 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
• On the minimum length of some linear codes
• Parameters for which the Griesmer bound is not sharp

This page was built for publication: A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802134)