Skip to main content
Springer Nature Link
Log in

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

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bose R.C., Chaudhuri, D.K.R.: On a class of error correcting binary group codes. Inf. Control 3(1), 68–79 (1960).

    Google Scholar 

  2. Bosma W., Cannon J., Playoust C.: The Magma algebra system. I. The user language. J. Symb. Comput. 24, 235–265 (1997).

    Google Scholar 

  3. Boston N.: Bounding minimum distances of cyclic codes using algebraic geometry. Electron. Notes Discret. Math. 6, 385–394 (2001).

  4. Grayson D.R., Stillman M.E.: Macaulay2, a software system for research in algebraic geometry. http://www.math.uiuc.edu/Macaulay2/.

  5. Hartmann C., Tzeng K.: Generalizations of the BCH bound. Inf. Control 20(5), 489–498 (1972).

    Google Scholar 

  6. Hartmann C., Tzeng K.: Decoding beyond the BCH bound using multiple sets of syndrome sequences. IEEE Trans. Inf. Theory 20(2), 292–295 (1974).

    Google Scholar 

  7. Hartmann C., Tzeng K., Chien R.: Some results on the minimum distance structure of cyclic codes. IEEE Trans. Inf. Theory 18(3), 402–409 (1972).

    Google Scholar 

  8. Hocquenghem A.: Codes correcteurs d-Erreurs. Chiffres (Paris) 2, 147–156 (1959).

  9. Roos C.: A generalization of the BCH bound for cyclic codes, including the Hartmann–Tzeng bound. J. Comb. Theory Ser. A 33(2), 229–232 (1982).

    Google Scholar 

  10. Roos C.: A new lower bound for the minimum distance of a cyclic code. IEEE Trans. Inf. Theory 29(3), 330–332 (1983).

    Google Scholar 

  11. Stichtenoth H.: Algebraic function fields and codes. Graduate Texts in Mathematics, 2nd edn, p. 254. Springer, Berlin (2009).

  12. Zeh A., Bezzateev S.V.: A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes. Des. Codes Cryptogr. (2012). doi:10.1007/s10623-012-9721-3.

  13. Zeh A., Wachter-Zeh A., Bezzateev S.V.: Decoding cyclic codes up to a new bound on the minimum distance. IEEE Trans. Inf. Theory 58(6), 3951–3960 (2012).

    Google Scholar 

  14. Zeh A., Wachter-Zeh A., Gadouleau M., Bezzateev S.V.: Generalizing bounds on the minimum distance of cyclic codes using cyclic product codes. Proceedings of IEEE ISIT-2013, pp. 126–130. Istanbul, Turkey (2013). doi:10.1109/ISIT.2013.6620201.

Download references

Acknowledgments

We first thank the referees for providing comments which helped in improving the contents of this paper. The author Seher Tutdere is partially supported by the Scientific and Technological Research Council of Turkey (TÜBİTAK) under the National Postdoctoral Research Scholarship No: 2218.

Author information

Authors and Affiliations

  1. Department of Mathematics and Institute of Applied Mathematics, Middle East Technical University, 06800 , Ankara, Turkey

    Ferruh Özbudak

  2. Department of Mathematics, Gebze Institute of Technology, Gebze/Kocaeli, Turkey

    Seher Tutdere

  3. Institute of Applied Mathematics, Middle East Technical University, 06800 , Ankara, Turkey

    Seher Tutdere & Oğuz Yayla

Authors
  1. Ferruh Özbudak
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Seher Tutdere
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Oğuz Yayla
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Seher Tutdere.

Additional information

Communicated by W. H. Haemers.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Özbudak, F., Tutdere, S. & Yayla, O. On some bounds on the minimum distance of cyclic codes over finite fields. Des. Codes Cryptogr. 76, 173–178 (2015). https://doi.org/10.1007/s10623-014-9927-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-014-9927-7

Keywords

Mathematics Subject Classification