New quasi-cyclic codes over GF(8) with improved minimum distances

Siap I.

ARS COMBINATORIA, vol.71, pp.239-247, 2004 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 71
  • Publication Date: 2004
  • Journal Name: ARS COMBINATORIA
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.239-247
  • Yıldız Technical University Affiliated: No


One of the most important problems of coding theory is to construct codes with the best possible minimum distance. The class of quasi-cyclic codes has proved to be a good source for such codes. In this paper, we use the algebraic structure of quasi-cyclic codes and the BCH type bound introduced in [17] to search for quasi-cyclic codes which improve the minimum distances of the best-known linear codes. We construct 11 new linear codes over GF(8) where 3 of these codes are one unit away from being optimal.