Construction of some optimal ternary linear codes and the uniqueness of \([294, 6, 195; 3]\)-codes meeting the Griesmer bound

DOI10.1006/ffta.1995.1036zbMath0841.94031OpenAlexW2036147946MaRDI QIDQ1904532

Noboru Hamada, Tor Helleseth

Publication date: 1 February 1996

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/ffta.1995.1036

zbMATH Keywords

Griesmer boundfinite projective geometryminihyper

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20) Combinatorial codes (94B25)

Related Items (1)

The nonexistence of ternary [79, 6, 51 codes]

This page was built for publication: Construction of some optimal ternary linear codes and the uniqueness of \([294, 6, 195; 3]\)-codes meeting the Griesmer bound