A new extension theorem for ternary linear codes and its application

DOI10.1016/j.ffa.2020.101711zbMath1464.94072OpenAlexW3041552939MaRDI QIDQ1994926

Hitoshi Kanda

Publication date: 18 February 2021

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

Full work available at URL: https://doi.org/10.1016/j.ffa.2020.101711

zbMATH Keywords

Griesmer boundternary linear codegeometric methodoptimal linear code

Mathematics Subject Classification ID

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

Related Items (4)

On the extendability of quaternary linear codes with four weights modulo 16 ⋮ Nonexistence of some ternary linear codes with minimum weight \(-2\) modulo 9 ⋮ Unnamed Item ⋮ Nonexistence of some ternary linear codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the minimum length of linear codes over the field of 9 elements
• Extendability of ternary linear codes
• A characterization of some \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry]
• On the minimum length of ternary linear codes
• On optimal non-projective ternary linear codes
• A new extension theorem for linear codes
• On the nonexistence of \(q\)-ary linear codes of dimension five
• On the extendability of linear codes

This page was built for publication: A new extension theorem for ternary linear codes and its application