On some bounds on the minimum distance of cyclic codes over finite fields

ÖZBUDAK F., TUTDERE S., YAYLA O.

Designs, Codes, and Cryptography, cilt.76, sa.2, ss.173-178, 2015 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 76 Sayı: 2
  • Basım Tarihi: 2015
  • Doi Numarası: 10.1007/s10623-014-9927-7
  • Dergi Adı: Designs, Codes, and Cryptography
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.173-178
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

© 2014, Springer Science+Business Media New York.Recently, A. Zeh, A. Wachter-Zeh, M. Gadouleau and S. Bezzateev gave a method to obtain new lower bounds on the minimum distance of cyclic codes over finite fields. Here we present some results on a generalization of this method. Then we apply it to several examples of cyclic codes and compare some known bounds with the bounds obtained by this generalization.