Some improvements to the extendability of ternary linear codes

DOI10.1016/j.ffa.2005.09.005zbMath1176.94072OpenAlexW1986604979MaRDI QIDQ946877

Kei Okamoto, Tatsuya Maruta

Publication date: 25 September 2008

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

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

zbMATH Keywords

projective geometryextension of linear codesdiversityternary linear codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Related Items

Nonexistence of some ternary linear codes with minimum weight \(-2\) modulo 9 ⋮ Extension theorems for linear codes over finite fields ⋮ New sufficient conditions for the extendability of quaternary linear codes ⋮ A new extension theorem for 3-weight modulo \(q\) linear codes over \({\mathbb{F}_q}\) ⋮ Extendability of 3-weight (mod \(q\)) linear codes over \(\mathbb F_q\)

Cites Work

• Unnamed Item
• Unnamed Item
• Classification of some optimal ternary linear codes of small length
• Extendability of ternary linear codes
• Extendability of linear codes over \(\operatorname {GF}(q)\) with minimum distance \(d\), \(\operatorname {gcd}(d,q)=1\)
• An extension theorem for linear codes
• A new extension theorem for linear codes
• Adding a parity-check bit
• On the extendability of linear codes

This page was built for publication: Some improvements to the extendability of ternary linear codes