On the non-existence of linear codes attaining the Griesmer bound

DOI10.1007/BF00150863MaRDI QIDQ1909585zbMATH OpenFDO

Authors Tatsuya Maruta

Publication date 19 June 1996

Published in Geometriae Dedicata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00150863

zbMATH Keywords

Griesmer boundlinear codes

Mathematics Subject Classification ID

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

Recommendations

• Nonexistence of linear codes meeting the Griesmer bound
• On the nonexistence of g-ary linear codes attaining the Griesmer bound.
• On the achievement of the Griesmer bound
• On the nonexistence of ternary linear codes attaining the Griesmer bound

Cited in

(11)

• A class of optimal linear codes of length one above the Griesmer bound
• New sufficient existence conditions for the codes that meet the Varshamov-Griesmer bound
• On the minimum size of some minihypers and related linear codes
• Forcing linearity on greedy 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\).
• scientific article; zbMATH DE number 3861051 (Why is no real title available?)
• The nonexistence of certain binary linear codes
• New upper bounds and constructions of multi-erasure locally recoverable codes
• Linear codes close to the Griesmer bound and the related geometric structures
• Affine blocking sets, three-dimensional codes and the Griesmer bound
• Nonexistence of some Griesmer codes over \(\mathbb{F}_q\)

This page was built for publication: On the non-existence of 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 Q1909585)