Skip to main content
Erschienen in: Cryptography and Communications 3/2022

12.11.2021

A class of binary cyclic codes with optimal parameters

verfasst von: Kaiqiang Liu, Qi Wang, Haode Yan

Erschienen in: Cryptography and Communications | Ausgabe 3/2022

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

For positive integers k ≥ 2 and t, let m = 2kt and α be a primitive element of the finite field \(\mathbb {F}_{2^{m}}\). In this paper, we study the parameters of a class of cyclic codes \(\mathcal {C}_{(1,v)}\) which has two zeros α and αv with \(v=\frac {2^{m}-1}{2^{t}+1}\). It is shown that \(\mathcal {C}_{(1,v)}\) is optimal or almost optimal with respect to the sphere packing bound. Based on some results of Kloosterman sums and Gaussian periods, the weight distribution of the dual code of \(\mathcal {C}_{(1,v)}\) is completely determined when t = 5.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Cao, X.: A note on the moments of Kloosterman sums. Appl. Algebra Engrg. Comm. Comput. 20(5-6), 447–457 (2009)MathSciNetCrossRef Cao, X.: A note on the moments of Kloosterman sums. Appl. Algebra Engrg. Comm. Comput. 20(5-6), 447–457 (2009)MathSciNetCrossRef
2.
Zurück zum Zitat Cao, X., Hu, L.: A construction of hyperbent functions with polynomial trace form. Sci. China Math. 54(10), 2229–2234 (2011)MathSciNetCrossRef Cao, X., Hu, L.: A construction of hyperbent functions with polynomial trace form. Sci. China Math. 54(10), 2229–2234 (2011)MathSciNetCrossRef
3.
Zurück zum Zitat Carlet, C., Ding, C., Yuan, J.: Linear codes from highly nonlinear functions and their secret sharing schemes. IEEE Trans. Inform. Theory 51(6), 2089–2102 (2005)MathSciNetCrossRef Carlet, C., Ding, C., Yuan, J.: Linear codes from highly nonlinear functions and their secret sharing schemes. IEEE Trans. Inform. Theory 51(6), 2089–2102 (2005)MathSciNetCrossRef
4.
Zurück zum Zitat Delsarte, P.: On subfield subcodes of modified Reed-Solomon codes. IEEE Trans. Inform. Theory 21(5), 575–576 (1975)MathSciNetCrossRef Delsarte, P.: On subfield subcodes of modified Reed-Solomon codes. IEEE Trans. Inform. Theory 21(5), 575–576 (1975)MathSciNetCrossRef
5.
Zurück zum Zitat Dinh, H. Q., Wang, X., Liu, H., Sriboonchitta, S.: On the Hamming distances of repeated- root consta cyclic codes of length 4ps. Discret. Math. 342(5), 1456–1470 (2019)CrossRef Dinh, H. Q., Wang, X., Liu, H., Sriboonchitta, S.: On the Hamming distances of repeated- root consta cyclic codes of length 4ps. Discret. Math. 342(5), 1456–1470 (2019)CrossRef
6.
Zurück zum Zitat Ding, C., Li, C., Li, N., Zhou, Z.: Three-weight cyclic codes and their weight distributions. Discret. Math. 339(2), 415–427 (2016)MathSciNetCrossRef Ding, C., Li, C., Li, N., Zhou, Z.: Three-weight cyclic codes and their weight distributions. Discret. Math. 339(2), 415–427 (2016)MathSciNetCrossRef
7.
Zurück zum Zitat Ding, C., Helleseth, T.: Optimal ternary cyclic codes from monomials. IEEE Trans. Inform. Theory 59(9), 5898–5904 (2013)MathSciNetCrossRef Ding, C., Helleseth, T.: Optimal ternary cyclic codes from monomials. IEEE Trans. Inform. Theory 59(9), 5898–5904 (2013)MathSciNetCrossRef
8.
Zurück zum Zitat Ding, C., Wang, X.: A coding theory construction of new systematic authentication codes. Theor. Comput. Sci. 330(1), 81–99 (2005)MathSciNetCrossRef Ding, C., Wang, X.: A coding theory construction of new systematic authentication codes. Theor. Comput. Sci. 330(1), 81–99 (2005)MathSciNetCrossRef
9.
Zurück zum Zitat Ding, C., Yang, Y., Tang, X.: Optimal sets of frequency hopping sequences from linear cyclic codes. IEEE Trans. Inform. Theory 56(7), 3605–3612 (2010)MathSciNetCrossRef Ding, C., Yang, Y., Tang, X.: Optimal sets of frequency hopping sequences from linear cyclic codes. IEEE Trans. Inform. Theory 56(7), 3605–3612 (2010)MathSciNetCrossRef
10.
11.
Zurück zum Zitat Dobbertin, H., Helleseth, T., Kumar, V., Martinsen, H.: Ternary m-sequences with three-valued cross-correlation function: New decimations of Welch and Niho type. IEEE Trans. Inform. Theory 47(4), 1473–1481 (2001)MathSciNetCrossRef Dobbertin, H., Helleseth, T., Kumar, V., Martinsen, H.: Ternary m-sequences with three-valued cross-correlation function: New decimations of Welch and Niho type. IEEE Trans. Inform. Theory 47(4), 1473–1481 (2001)MathSciNetCrossRef
12.
Zurück zum Zitat Helleseth, T., Kholosha, A.: Monomial and quadratic bent functions over the finite fields of odd characteristic. IEEE Trans Inform. Theory 52(5), 2018–2032 (2006)MathSciNetCrossRef Helleseth, T., Kholosha, A.: Monomial and quadratic bent functions over the finite fields of odd characteristic. IEEE Trans Inform. Theory 52(5), 2018–2032 (2006)MathSciNetCrossRef
13.
Zurück zum Zitat Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)CrossRef Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)CrossRef
14.
Zurück zum Zitat Kløve, T.: Codes for Error Detection, World Scientific. World Scientific Publishing Co., Inc., New Jersey (2007)CrossRef Kløve, T.: Codes for Error Detection, World Scientific. World Scientific Publishing Co., Inc., New Jersey (2007)CrossRef
15.
Zurück zum Zitat Lachaud, G., Wolfmann, J.: The weights of the orthogonals of the extended quadratic binary Goppa codes. IEEE Trans. Inform. Theory 36(3), 686–692 (1990)MathSciNetCrossRef Lachaud, G., Wolfmann, J.: The weights of the orthogonals of the extended quadratic binary Goppa codes. IEEE Trans. Inform. Theory 36(3), 686–692 (1990)MathSciNetCrossRef
16.
Zurück zum Zitat Li, C., Yue, Q., Li, F.: Weight distributions of cyclic codes with respect to pairwise coprime order elements. Finite Fields Appl. 28, 94–114 (2014)MathSciNetCrossRef Li, C., Yue, Q., Li, F.: Weight distributions of cyclic codes with respect to pairwise coprime order elements. Finite Fields Appl. 28, 94–114 (2014)MathSciNetCrossRef
17.
19.
Zurück zum Zitat Luo, R., Wei, L., Cheng, F., Du, X.: A class of binary cyclic codes with four weights. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A, 965–968 (2017)CrossRef Luo, R., Wei, L., Cheng, F., Du, X.: A class of binary cyclic codes with four weights. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A, 965–968 (2017)CrossRef
20.
Zurück zum Zitat Shi, M., Li, X., Neri, A., Solė, P.: : How many weights can a cyclic code have? IEEE Trans. Inform. Theory 66(3), 1449–1459 (2020)MathSciNetCrossRef Shi, M., Li, X., Neri, A., Solė, P.: : How many weights can a cyclic code have? IEEE Trans. Inform. Theory 66(3), 1449–1459 (2020)MathSciNetCrossRef
21.
Zurück zum Zitat Yang, J., Xiong, M., Ding, C., Luo, J.: Weight distribution of a class of cyclic codes with arbitrary number of zeros. IEEE Trans. Inform. Theory 59(9), 5985–5993 (2013)MathSciNetCrossRef Yang, J., Xiong, M., Ding, C., Luo, J.: Weight distribution of a class of cyclic codes with arbitrary number of zeros. IEEE Trans. Inform. Theory 59(9), 5985–5993 (2013)MathSciNetCrossRef
22.
Zurück zum Zitat Zeng, X., Fan, C., Zeng, Q., Qi, Y.: Two classes of binary cyclic codes and their weight distributions. Appli. Algebra Engin., Commun. Comput. 32, 49–61 (2021)MathSciNetCrossRef Zeng, X., Fan, C., Zeng, Q., Qi, Y.: Two classes of binary cyclic codes and their weight distributions. Appli. Algebra Engin., Commun. Comput. 32, 49–61 (2021)MathSciNetCrossRef
Metadaten
Titel
A class of binary cyclic codes with optimal parameters
verfasst von
Kaiqiang Liu
Qi Wang
Haode Yan
Publikationsdatum
12.11.2021
Verlag
Springer US
Erschienen in
Cryptography and Communications / Ausgabe 3/2022
Print ISSN: 1936-2447
Elektronische ISSN: 1936-2455
DOI
https://doi.org/10.1007/s12095-021-00548-1

Weitere Artikel der Ausgabe 3/2022

Cryptography and Communications 3/2022 Zur Ausgabe