On the minimum length of ternary linear codes
From MaRDI portal
Publication:1952265
DOI10.1007/s10623-011-9593-yzbMath1301.94140OpenAlexW1983816381MaRDI QIDQ1952265
Publication date: 30 May 2013
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-011-9593-y
Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Combinatorial structures in finite projective spaces (51E20)
Related Items (4)
On the nonexistence of ternary linear codes attaining the Griesmer bound ⋮ Nonexistence of some ternary linear codes with minimum weight \(-2\) modulo 9 ⋮ Nonexistence of some ternary linear codes ⋮ A new extension theorem for ternary linear codes and its application
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extension theorems for linear codes over finite fields
- On optimal ternary linear codes of dimension 6
- Classification of some optimal ternary linear codes of small length
- Ternary linear codes and quadrics
- Optimal ternary linear codes
- Caps and codes
- Divisibility of codes meeting the Griesmer bound
- The nonexistence of some optimal ternary codes of dimension five
- An optimal ternary [69,5,45 code and related codes]
- The correspondence between projective codes and 2-weight codes
- 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 nonexistence of quaternary \([51, 4, 37\) codes]
- An extension theorem for linear codes
- On optimal non-projective ternary linear codes
- Fundamentals of Error-Correcting Codes
- Some new results for optimal ternary linear codes
- On the nonexistence of \(q\)-ary linear codes of dimension five
This page was built for publication: On the minimum length of ternary linear codes
