Some new ternary linear codes

Let an [n; k; d]q code be a linear code of length n, dimension k and minimum Hamming distance d over GF(q). One of the most important problems in coding theory is to construct codes with optimal minimum distances. In this paper 22 new ternary linear codes are presented. Two of them are optimal. All new codes improve the respective lower bounds in [11].