On codes meeting the Griesmer bound.
From MaRDI portal
Publication:1421529
DOI10.1016/S0012-365X(03)00201-2zbMath1045.94022OpenAlexW2089318832MaRDI QIDQ1421529
Publication date: 26 January 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00201-2
Related Items (6)
Extension theorems for linear codes over finite fields ⋮ Nonexistence of some Griesmer codes over \(\mathbb{F}_q\) ⋮ Parameters for which the Griesmer bound is not sharp ⋮ Linear codes close to the Griesmer bound and the related geometric structures ⋮ Linear codes over \(\mathbb {F}_{q}[x/(x^2)\) and \(\mathrm{GR}(p^2,m)\) reaching the Griesmer bound] ⋮ A class of optimal linear codes of length one above the Griesmer bound
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Projective codes meeting the Griesmer bound
- On the achievement of the Griesmer bound
- A characterization of some \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry]
- A construction of some \([n,k,d;q\)-codes meeting the Griesmer bound]
- Algebraically punctured cyclic codes
- A Bound for Error-Correcting Codes
This page was built for publication: On codes meeting the Griesmer bound.
