Some New Optimal Ternary Linear Codes

Let d₃(n,k) be the maximum possible minimum Hamming distance of a ternary n,k,d;3]-code for given values of n and k. It is proved that d₃(44,6)=27, d₃(76,6)=48,d₃(94,6)=60 , d₃(124,6)=81,d₃(130,6)=84 , d₃(134,6)=87,d₃(138,6)=90 , d₃(148,6)=96,d₃(152,6)=99 , d₃(156,6)=102,d₃(164,6)=108 , d₃(170,6)=111,d₃(179,6)=117 , d₃(188,6)=123,d₃(206,6)=135 , d₃(211,6)=138,d₃(224,6)=147 , d₃(228,6)=150,d₃(236,6)=156 , d₃(31,7)=17 and d₃(33,7)=18 . These results are obtained by a descent method for designing good linear codes.