Improvements to the bounds on optimal ternary linear codes of dimension 6

In this correspondence, new ternary codes of dimension 6 are presented which improve the bounds on optimal linear codes. These codes belong to the class of quasi-twisted (QT) codes, and have been constructed using a greedy algorithm. This work extends previous results on QT codes of dimension 6. In particular, several new two-weight QT codes are presented. Numerous new optimal codes which meet the Griesmer bound are given, as well as others which establish lower bounds on the maximum minimum distance. Index Terms - Optimal ternary linear codes, quasi-twisted codes.