On the achievement of the Griesmer bound
From MaRDI portal
Publication:1364213
DOI10.1023/A:1008250010928zbMath0887.94016OpenAlexW1481844012MaRDI QIDQ1364213
Publication date: 29 May 1998
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008250010928
Linear codes (general theory) (94B05) Bounds on codes (94B65) Combinatorial aspects of finite geometries (05B25)
Related Items
On the nonexistence of ternary linear codes attaining the Griesmer bound ⋮ Characterization and classification of optimal LCD codes ⋮ On the geometric constructions of optimal linear codes ⋮ On critical exponents of Dowling matroids ⋮ Unnamed Item ⋮ Nonexistence of some ternary linear codes with minimum weight \(-2\) modulo 9 ⋮ On codes meeting the Griesmer bound. ⋮ Parameters for which the Griesmer bound is not sharp ⋮ Linear codes close to the Griesmer bound and the related geometric structures ⋮ On the minimum length of linear codes over the field of 9 elements ⋮ On the extendability of linear codes ⋮ The non-existence of Griesmer codes with parameters close to codes of Belov type ⋮ A class of optimal linear codes of length one above the Griesmer bound
This page was built for publication: On the achievement of the Griesmer bound
