On the non-existence of linear codes attaining the Griesmer bound
From MaRDI portal
Publication:1909585
DOI10.1007/BF00150863zbMath0839.94010MaRDI QIDQ1909585
Publication date: 19 June 1996
Published in: Geometriae Dedicata (Search for Journal in Brave)
Linear codes (general theory) (94B05) Bounds on codes (94B65) Combinatorial structures in finite projective spaces (51E20)
Related Items (4)
New upper bounds and constructions of multi-erasure locally recoverable codes ⋮ Linear codes close to the Griesmer bound and the related geometric structures ⋮ On the minimum size of some minihypers and related 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\).]
This page was built for publication: On the non-existence of linear codes attaining the Griesmer bound
