Projective codes meeting the Griesmer bound

DOI10.1016/0012-365X(92)90553-RzbMath0755.94010OpenAlexW2147585387MaRDI QIDQ1199610

Tor Helleseth

Publication date: 16 January 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90553-r

zbMATH Keywords

Griesmer boundprojective codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Related Items (3)

On the non-existence of a projective (75, 4, 12, 5) set in PG(3, 7) ⋮ On codes meeting the Griesmer bound. ⋮ A family of linear codes from constant dimension subspace codes

Cites Work

• On a geometrical method of construction of maximal t-linearly independent sets
• Caps and codes
• A new class of nonbinary 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 characterization of codes meeting the Griesmer bound
• Algebraically punctured cyclic codes
• A Bound for Error-Correcting Codes
• Unnamed Item

This page was built for publication: Projective codes meeting the Griesmer bound