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

2015-08-01
Özbudak, Ferruh
TUTDERE, Seher
YAYLA, Oguz
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.

Citation Formats
F. Özbudak, S. TUTDERE, and O. YAYLA, “On some bounds on the minimum distance of cyclic codes over finite fields,” DESIGNS CODES AND CRYPTOGRAPHY, vol. 76, no. 2, pp. 173–178, 2015, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/47058.