IEEE TRANSACTIONS ON INFORMATION THEORY, vol.46, no.4, pp.1554-1558, 2000 (Journal Indexed in SCI)
One of the most important problems of coding theory is to construct codes with best possible minimum distances. In this correspondence, using the structure of quasi-cyclic (QC) codes with a BCR-type bound given in [1], ae have found 20 new ternary quasi-cyclic codes with improved minimum distances.