One of the most important problems of coding theory is to construct codes w
ith best possible minimum distances. In this correspondence, using the stru
cture of quasi-cyclic (QC) codes with a BCR-type bound given in [1], ae hav
e found 20 new ternary quasi-cyclic codes with improved minimum distances.