New ternary quasi-cyclic codes with better minimum distances

Abstract

One of the most important problems of coding theory is to construct codes with best possible minimum distances. In this article, using the structure of quasi-cyclic (QC) codes with a BCH-type bound given by Lally and Fitzpatrick (see WCC '99, Workshop on Coding and Cryptography, Paris, France, 1999), we have found 20 new ternary quasi-cyclic codes with improved minimum distances.