New constructions of codes meeting the Griesmer bound

DOI10.1109/TIT.1983.1056658zbMath0523.94018MaRDI QIDQ3037317

Tor Helleseth

Publication date: 1983

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

Griesmer boundoptimal codes\((g(k,d),k,d)\) codes\((n,k,d)\) code

Mathematics Subject Classification ID

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

Related Items (4)

An improvement of the Griesmer bound for some small minimum distances ⋮ A characterization of some \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry] ⋮ A survey of recent works with respect to a characterization of an (n,k,d;q)-code meeting the Griesmer bound using a min\(\cdot hyper\) in a finite projective geometry ⋮ A new class of nonbinary codes meeting the Griesmer bound

This page was built for publication: New constructions of codes meeting the Griesmer bound