Projective codes meeting the Griesmer bound
From MaRDI portal
Recommendations
- New constructions of codes meeting the Griesmer bound
- On codes meeting the Griesmer bound.
- Further classifications of codes meeting the Griesmer bound (Corresp.)
- Multiple blocking sets in finite projective spaces and improvements to the Griesmer bound for linear codes
- A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
Cites work
- scientific article; zbMATH DE number 426126 (Why is no real title available?)
- A Bound for Error-Correcting Codes
- A characterization of 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
- A new class of nonbinary codes meeting the Griesmer bound
- Algebraically punctured cyclic codes
- Caps and codes
- On a geometrical method of construction of maximal t-linearly independent sets
Cited in
(5)- scientific article; zbMATH DE number 1117678 (Why is no real title available?)
- A family of linear codes from constant dimension subspace codes
- On codes meeting the Griesmer bound.
- Classification of Griesmer codes and dual transform
- On the non-existence of a projective \((75, 4, 12, 5)\) set in \(\mathrm{PG}(3, 7)\)
This page was built for publication: Projective codes meeting the Griesmer bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1199610)