Classification of some optimal ternary linear codes of small length
From MaRDI portal
Publication:676693
DOI10.1023/A:1008292320488zbMath0869.94031OpenAlexW1584712108MaRDI QIDQ676693
Petr Lisoněk, Marijn van Eupen
Publication date: 20 May 1997
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008292320488
Related Items (17)
The nonexistence of ternary \([105,6,68\) and \([230,6,152]\) codes] ⋮ A geometric approach to classifying Griesmer codes ⋮ Nonexistence of some ternary linear codes with minimum weight \(-2\) modulo 9 ⋮ Extension theorems for linear codes over finite fields ⋮ On the minimum length of ternary linear codes ⋮ New sufficient conditions for the extendability of quaternary linear codes ⋮ On complete caps in the projective geometries over \(\mathbb F_3\) ⋮ Nonexistence of some ternary linear codes ⋮ Some improvements to the extendability of ternary linear codes ⋮ On optimal non-projective ternary linear codes ⋮ The nonexistence of ternary [97, 6, 63 codes] ⋮ The nonexistence of some ternary linear codes of dimension 6 ⋮ On the binary projective codes with dimension 6 ⋮ Extendability of ternary linear codes ⋮ \((l,s)\)-extension of linear codes ⋮ The nonexistence of ternary [79, 6, 51 codes] ⋮ The classification of the largest caps in AG(5, 3)
This page was built for publication: Classification of some optimal ternary linear codes of small length
