On the nonexistence of g-ary linear codes attaining the Griesmer bound.

zbMATH Open1224.94059MaRDI QIDQ3073554FDOQ3073554

Authors: Xiuli Li 

Publication date: 11 February 2011

Recommendations

• Nonexistence of linear codes meeting the Griesmer bound
• Nonexistence of some Griesmer codes over \(\mathbb{F}_q\)
• On the nonexistence of ternary linear codes attaining the Griesmer bound
• On the achievement of the Griesmer bound
• On the nonexistence of \(q\)-ary linear codes of dimension five

zbMATH Keywords

projective spaceextension of linear codeslinear code, Griesmer bound

Mathematics Subject Classification ID

Blocking sets, ovals, (k)-arcs (51E21) Linear codes (general theory) (94B05) Linear codes and caps in Galois spaces (51E22) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cited In (12)

• Note on an improvement of the Griesmer bound for \(q\)-ary linear codes
• Linear codes over \(\mathbb {F}_{q}[x]/(x^2)\) and \(\mathrm{GR}(p^2,m)\) reaching the Griesmer bound
• On the nonexistence of ternary linear codes attaining the Griesmer bound
• On codes meeting the Griesmer bound.
• A sequence of unique quaternary Griesmer codes
• The non-existence of Griesmer codes with parameters close to codes of Belov type
• Nonexistence of some Griesmer codes over \(\mathbb{F}_q\)
• A class of optimal linear codes of length one above the Griesmer bound
• Title not available (Why is that?)
• Nonexistence of linear codes meeting the Griesmer bound
• Nonexistence of some four dimensional linear codes attaining the Griesmer bound
• Parameters for which the Griesmer bound is not sharp

This page was built for publication: On the nonexistence of \(g\)-ary linear codes attaining the Griesmer bound.

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