New distance bounds for quasi-cyclic codes

ÖZBUDAK F., ÖZKAYA B.

Designs, Codes, and Cryptography, cilt.92, sa.12, ss.3981-4009, 2024 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 92 Sayı: 12
  • Basım Tarihi: 2024
  • Doi Numarası: 10.1007/s10623-024-01464-0
  • Dergi Adı: Designs, Codes, and Cryptography
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, PASCAL, Applied Science & Technology Source, Compendex, Computer & Applied Sciences, INSPEC, MathSciNet, zbMATH
  • Sayfa Sayıları: ss.3981-4009
  • Anahtar Kelimeler: 11T71, 94B60, 94B65, Concatenated structure, Minimum distance bounds, Quasi-cyclic codes
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

We consider the minimum weight of codewords in a quasi-cyclic code and characterize the estimate in its most general setup using their concatenated structure. The new bound we derive generalizes the Jensen and Güneri–Özbudak bounds and it holds for the more general class of multilevel concatenated codes.