On the nonexistence of ternary linear codes attaining the Griesmer bound

DOI10.1007/s10623-022-01021-7zbMath1502.94047OpenAlexW4213104090WikidataQ114849776 ScholiaQ114849776MaRDI QIDQ2119947

Daiki Kawabata, Tatsuya Maruta

Publication date: 31 March 2022

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

Full work available at URL: https://doi.org/10.1007/s10623-022-01021-7

zbMATH Keywords

Griesmer boundoptimal linear codesgeometric method

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Combinatorial structures in finite projective spaces (51E20)

Uses Software

• Q-extension

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the geometric constructions of optimal linear codes
• Extension theorems for linear codes over finite fields
• The nonexistence of some ternary linear codes of dimension 6
• A class of optimal linear codes of length one above the Griesmer bound
• The smallest length of binary 7-dimensional linear codes with prescribed minimum distance
• Divisibility of codes meeting the Griesmer bound
• The correspondence between projective codes and 2-weight codes
• On the achievement of the Griesmer bound
• Construction of new Griesmer codes of dimension 5
• On the nonexistence of quaternary \([51, 4, 37\) codes]
• On the minimum length of ternary linear codes
• On optimal non-projective ternary linear codes
• Some new results for optimal ternary linear codes
• Computer Classification of Linear Codes
• A Bound for Error-Correcting Codes
• On the nonexistence of \(q\)-ary linear codes of dimension five

This page was built for publication: On the nonexistence of ternary linear codes attaining the Griesmer bound