A necessary and sufficient condition for the existence of some ternary [n,k,d] codes meeting the Griesmer bound

DOI10.1023/A:1008288219580MaRDI QIDQ676690zbMATH OpenOpenAlexFDO

Authors Noboru Hamada

Publication date 20 May 1997

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008288219580

zbMATH Keywords

Griesmer boundminihyperternary linear code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• On the nonexistence of ternary linear codes attaining the Griesmer bound
• The nonexistence of some optimal ternary codes of dimension five
• Publication:4888092

Cited in

(4)

• New sufficient existence conditions for the codes that meet the Varshamov-Griesmer bound
• On the nonexistence of ternary linear codes attaining the Griesmer bound
• On optimal non-projective ternary linear codes
• scientific article; zbMATH DE number 908770 (Why is no real title available?)

This page was built for publication: A necessary and sufficient condition for the existence of some ternary \([n,k,d]\) codes meeting the Griesmer bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676690)