Parameters for which the Griesmer bound is not sharp
From MaRDI portal
Recommendations
- Multiple blocking sets in finite projective spaces and improvements to the Griesmer bound for linear codes
- On the achievement of the Griesmer bound
- On the sharpness of the Griesmer bound
- On the nonexistence of ternary linear codes attaining the Griesmer bound
- On the nonexistence of \(g\)-ary linear codes attaining the Griesmer bound.
Cites work
- scientific article; zbMATH DE number 5121640 (Why is no real title available?)
- scientific article; zbMATH DE number 1189050 (Why is no real title available?)
- scientific article; zbMATH DE number 872500 (Why is no real title available?)
- A Bound for Error-Correcting Codes
- A characterization of multiple \((n-k)\)-blocking sets in projective spaces of square order
- A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
- Algebraically punctured cyclic codes
- On block codes with specified maximum distance (Corresp.)
- On codes meeting the Griesmer bound.
- On the achievement of the Griesmer bound
- On the size of a blocking set in \(\text{PG}(2,p)\)
Cited in
(4)
This page was built for publication: Parameters for which the Griesmer bound is not sharp
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2461198)