A class of optimal linear codes of length one above the Griesmer bound
From MaRDI portal
Publication:1009128
DOI10.1007/s10623-008-9239-xzbMath1237.94149OpenAlexW2022569257MaRDI QIDQ1009128
Publication date: 31 March 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-008-9239-x
Linear codes (general theory) (94B05) Bounds on codes (94B65) Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20)
Related Items (3)
On the nonexistence of ternary linear codes attaining the Griesmer bound ⋮ On the geometric constructions of optimal linear codes ⋮ Nonexistence of some Griesmer codes over \(\mathbb{F}_q\)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Divisibility of codes meeting the Griesmer bound
- A characterization of some minihypers and its application to linear codes
- On the achievement of the Griesmer bound
- On codes meeting the Griesmer bound.
- A characterization of some \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry]
- On the minimum length of some linear codes
- Parameters for which the Griesmer bound is not sharp
- On the nonexistence of \(q\)-ary linear codes of dimension five
This page was built for publication: A class of optimal linear codes of length one above the Griesmer bound
