New ternary quasi-cyclic codes with better minimum distances

Siap I., AYDIN N., RAY-CHAUDHURI D.

IEEE TRANSACTIONS ON INFORMATION THEORY, cilt.46, sa.4, ss.1554-1558, 2000 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Kısa Makale
  • Cilt numarası: 46 Sayı: 4
  • Basım Tarihi: 2000
  • Doi Numarası: 10.1109/18.850694
  • Dergi Adı: IEEE TRANSACTIONS ON INFORMATION THEORY
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.1554-1558
  • Yıldız Teknik Üniversitesi Adresli: Hayır

Özet

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.