New bounds on the minimum distance of cyclic codes

Ling S., ÖZKAYA B.

Advances in Mathematics of Communications, cilt.15, sa.1, ss.1-8, 2021 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 15 Sayı: 1
  • Basım Tarihi: 2021
  • Doi Numarası: 10.3934/amc.2020038
  • Dergi Adı: Advances in Mathematics of Communications
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Applied Science & Technology Source, MathSciNet, zbMATH
  • Sayfa Sayıları: ss.1-8
  • Anahtar Kelimeler: Cyclic codes, Minimum distance bound, Product code, Roos bound
  • Orta Doğu Teknik Üniversitesi Adresli: Hayır

Özet

Two bounds on the minimum distance of cyclic codes are proposed. The first one generalizes the Roos bound by embedding the given cyclic code into a cyclic product code. The second bound also uses a second cyclic code, namely the non-zero-locator code, but is not directly related to cyclic product codes and it generalizes a special case of the Roos bound.