scientific article; zbMATH DE number 5121640
From MaRDI portal
Publication:3418342
zbMATH Open1118.94008MaRDI QIDQ3418342FDOQ3418342
Authors: Leo Storme 
Publication date: 2 February 2007
Title of this publication is not available (Why is that?)
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
Linear codes (general theory) (94B05) Bounds on codes (94B65) Linear codes and caps in Galois spaces (51E22)
Cited In (9)
- Weighted \(\{\delta (q+1),\delta ;k-1,q\}\)-minihypers
- The Use of Blocking Sets in Galois Geometries and in Related Research Areas
- Tight sets, weighted \(m\)-covers, weighted \(m\)-ovoids, and minihypers
- On a particular class of minihypers and its applications. II: Improvements for \(q\) square
- A construction of \(q\)-ary linear codes with irreducible cyclic codes
- On a particular class of minihypers and its applications. III: Applications
- A geometric approach to classifying Griesmer codes
- Linear codes close to the Griesmer bound and the related geometric structures
- 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)
