scientific article; zbMATH DE number 5121640
From MaRDI portal
Publication:3418342
Recommendations
- Linear codes close to the Griesmer bound and the related geometric structures
- Minihypers and linear codes meeting the Griesmer bound: Improvements to results of Hamada, Helleseth and Maekawa
- scientific article; zbMATH DE number 2154120
- Characterization results on weighted minihypers and on linear codes meeting the Griesmer bound
- scientific article; zbMATH DE number 1795249
- Characterization results on arbitrary non-weighted minihypers and on linear codes meeting the Griesmer bound
- On the geometric constructions of optimal linear codes
- A characterization of some minihypers and its application to linear codes
- On the covering radius of binary, linear codes meeting the Griesmer bound
- Linear programming bounds for codes in grassmannian spaces
Cited in
(9)- A geometric approach to classifying Griesmer codes
- A construction of \(q\)-ary linear codes with irreducible cyclic codes
- Linear codes close to the Griesmer bound and the related geometric structures
- On a particular class of minihypers and its applications. II: Improvements for \(q\) square
- Weighted \(\{\delta (q+1),\delta ;k-1,q\}\)-minihypers
- On a particular class of minihypers and its applications. III: Applications
- Tight sets, weighted \(m\)-covers, weighted \(m\)-ovoids, and minihypers
- The use of blocking sets in Galois geometries and in related research areas
- Parameters for which the Griesmer bound is not sharp
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3418342)
