A construction of some \([n,k,d;q]\)-codes meeting the Griesmer bound

DOI10.1016/0012-365X(93)90405-IzbMath0770.94008OpenAlexW2167295055MaRDI QIDQ1802135

Fumikazu Tamari

Publication date: 13 September 1993

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90405-i

zbMATH Keywords

linear programmingminimum distanceminihypersoptimal linear codes\(q\)-ary linear codeGriesmer's boundmaxhypers

Mathematics Subject Classification ID

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

Related Items (2)

On codes meeting the Griesmer bound. ⋮ Linear codes over \(\mathbb {F}_{q}[x/(x^2)\) and \(\mathrm{GR}(p^2,m)\) reaching the Griesmer bound]

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Goppa codes that are better than the Varshamov-Gilbert bound
• On the uniqueness of \((q+1)_ 4\)-arcs of \(PG(4,q),q=2^ h,h\vee\)
• On linear codes which attain the Solomon-Stiffler bound
• Some optimal codes from algebraic geometry and their covering radii
• Construction of optimal linear codes using flats and spreads in a finite projective geometry
• Minimum block length of a linear q-ary code with specified dimension and code distance
• The non-classical 10-arc of PG(4,9)
• Characterization of \(\{v_{\mu +1}+2v_{\mu},v_{\mu}+2v_{\mu - 1};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes
• Some results concerning \(\{(q+1)(n-1);\;n\}\)-arcs and \(\{(q+1)\;(n-1)+1;\;n\}\)-arcs in finite projective planes of order \(q\)
• On a geometrical method of construction of maximal t-linearly independent sets
• 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
• Maximal sets of points in finite projective space, no t-linearly dependent
• On maximal \(t\)-linearly independent sets
• Codes and information
• On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound
• Construction of Optimal Codes and Optimal Fractional Factorial Designs Using Linear Programming
• A characterization of codes meeting the Griesmer bound
• Error Detecting and Error Correcting Codes
• Algebraically punctured cyclic codes
• Some maximal arcs in finite projective planes
• A Bound for Error-Correcting Codes
• A note on the Griesmer bound (Corresp.)
• Orthogonal Arrays of Index Unity

This page was built for publication: A construction of some \([n,k,d;q]\)-codes meeting the Griesmer bound