Further classifications of codes meeting the Griesmer bound (Corresp.)

DOI10.1109/TIT.1984.1056867zbMath0541.94017OpenAlexW2068342957MaRDI QIDQ3329371

Tor Helleseth

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1109/tit.1984.1056867

zbMATH Keywords

Griesmer boundbinary linear code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (5)

A weighted version of a result of Hamada on minihypers and on linear codes meeting the Griesmer bound ⋮ Sufficient conditions for monotonicity of the undetected error probability for large channel error probabilities ⋮ A characterization of some \(\{v_ 2+2v_ 3,v_ 1+2v_ 2;k-1,3\}\)-minihypers and some \((v_ k-30,k,3^{k-1}-21;3)\)-codes meeting the Griesmer bound ⋮ A family of linear codes from constant dimension subspace codes ⋮ Classification of Griesmer codes and dual transform

This page was built for publication: Further classifications of codes meeting the Griesmer bound (Corresp.)