Skip to main content
Erschienen in: Cryptography and Communications 1/2021

06.10.2020

Two families of subfield codes with a few weights

verfasst von: Can Xiang, Wenjuan Yin

Erschienen in: Cryptography and Communications | Ausgabe 1/2021

Einloggen

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

search-config
loading …

Abstract

Subfield codes of linear codes over finite fields have recently received a lot of attention, as some of these codes are optimal and have applications in secrete sharing, authentication codes and association schemes. In this paper, two families of binary subfield codes with a few weights are presented from two special classes of linear codes, and their parameters are explicitly determined. Moreover, the parameters of the duals of these subfield codes are also studied. The two infinite families of subfield codes presented in this paper are distance-optimal with respect to the Griesmer bound and their duals are almost distance-optimal with respect to the sphere-packing bound.

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 Canteaut, A., Charpin, P., Dobbertin, H.: Weight divisibility of cyclic codes, highly nonlinear functions on \(\mathbb {F}_{2^{n}}\), and crosscorrelation of maximum-length sequences. SIAM Disc. Math. 13(1), 105–138 (2000)CrossRef Canteaut, A., Charpin, P., Dobbertin, H.: Weight divisibility of cyclic codes, highly nonlinear functions on \(\mathbb {F}_{2^{n}}\), and crosscorrelation of maximum-length sequences. SIAM Disc. Math. 13(1), 105–138 (2000)CrossRef
2.
Zurück zum Zitat Carlet, C., Charpin, P., Zinoviev, V.: Codes, bent functions and permutations suitable for DES-like cryptosystems. Des. Codes Cryptogr. 15(2), 125–156 (1998)MathSciNetCrossRef Carlet, C., Charpin, P., Zinoviev, V.: Codes, bent functions and permutations suitable for DES-like cryptosystems. Des. Codes Cryptogr. 15(2), 125–156 (1998)MathSciNetCrossRef
3.
Zurück zum Zitat Cannon, J., Bosma, W., Fieker, C., Stell, E.: Handbook of magma functions, version 2.19. Sydney (2013) Cannon, J., Bosma, W., Fieker, C., Stell, E.: Handbook of magma functions, version 2.19. Sydney (2013)
4.
5.
Zurück zum Zitat Ding, C.: Designs from Linear Codes. World Scientific, Singapore (2018)CrossRef Ding, C.: Designs from Linear Codes. World Scientific, Singapore (2018)CrossRef
7.
Zurück zum Zitat Ding, C.: A construction of binary linear codes from Boolean functions. Discret. Math. 339(9), 2288–2303 (2016)MathSciNetCrossRef Ding, C.: A construction of binary linear codes from Boolean functions. Discret. Math. 339(9), 2288–2303 (2016)MathSciNetCrossRef
8.
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
9.
Zurück zum Zitat Ding, C., Liu, Y., Ma, C., Zeng, L.: The weight distributions of the duals of cyclic codes with two zeros. IEEE Trans. Inf. Theory 57(12), 8000–8006 (2011)MathSciNetCrossRef Ding, C., Liu, Y., Ma, C., Zeng, L.: The weight distributions of the duals of cyclic codes with two zeros. IEEE Trans. Inf. Theory 57(12), 8000–8006 (2011)MathSciNetCrossRef
10.
Zurück zum Zitat Ding, K., Ding, C.: A class of two-weight and three-weight codes and their applications in secret sharing. IEEE Trans. Inf. Theory 61(11), 5835–5842 (2015)MathSciNetCrossRef Ding, K., Ding, C.: A class of two-weight and three-weight codes and their applications in secret sharing. IEEE Trans. Inf. Theory 61(11), 5835–5842 (2015)MathSciNetCrossRef
11.
Zurück zum Zitat Heng, Z., Ding, C.: The subfield codes of hyperoval and conic codes. Finite Fields Their Appl. 56, 308–331 (2019)MathSciNetCrossRef Heng, Z., Ding, C.: The subfield codes of hyperoval and conic codes. Finite Fields Their Appl. 56, 308–331 (2019)MathSciNetCrossRef
12.
Zurück zum Zitat Heng, Z., Ding, C., Wang, W.: Optimal binary linear codes from maximal arcs. IEEE Trans. Inf. Theory 66(9), 5387–5394 (2020)MathSciNetCrossRef Heng, Z., Ding, C., Wang, W.: Optimal binary linear codes from maximal arcs. IEEE Trans. Inf. Theory 66(9), 5387–5394 (2020)MathSciNetCrossRef
15.
Zurück zum Zitat Heng, Z., Yue, Q.: Complete weight distributions of two classes of cyclic codes. Cryptogr. Commun. 9(3), 323–343 (2017)MathSciNetCrossRef Heng, Z., Yue, Q.: Complete weight distributions of two classes of cyclic codes. Cryptogr. Commun. 9(3), 323–343 (2017)MathSciNetCrossRef
17.
Zurück zum Zitat Huffman, W. C., Pless, V.: Fundamentals of error-correcting codes. Cambridge Univ Press, Cambridge (2003) Huffman, W. C., Pless, V.: Fundamentals of error-correcting codes. Cambridge Univ Press, Cambridge (2003)
18.
Zurück zum Zitat Li, C., Yue, Q., Li, F.: Weight distributions of cyclic codes with respect to pairwise coprime order elements. Finite Fields Their 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 Their Appl. 28, 94–114 (2014)MathSciNetCrossRef
19.
Zurück zum Zitat Li, C., Yue, Q.: Weight distributions of two classes of cyclic codes with respect to two distinct order elements. IEEE Trans. Inf. Theory 60(1), 296–303 (2014)MathSciNetCrossRef Li, C., Yue, Q.: Weight distributions of two classes of cyclic codes with respect to two distinct order elements. IEEE Trans. Inf. Theory 60(1), 296–303 (2014)MathSciNetCrossRef
20.
Zurück zum Zitat Klove, T.: Codes for Error Detection. World Scientific, Hackensack (2007)CrossRef Klove, T.: Codes for Error Detection. World Scientific, Hackensack (2007)CrossRef
21.
Zurück zum Zitat Lidl, R., Niederreiter, H.: Finite Fields. Cambridge Univ Press, Cambridge (1997)MATH Lidl, R., Niederreiter, H.: Finite Fields. Cambridge Univ Press, Cambridge (1997)MATH
22.
Zurück zum Zitat Mesnager, S., Sinak, A.: Several classes of minimal linear codes with few weights from weakly regular plateaued functions. IEEE Trans. Inf. Theory 66(4), 2296–2310 (2020)MathSciNetCrossRef Mesnager, S., Sinak, A.: Several classes of minimal linear codes with few weights from weakly regular plateaued functions. IEEE Trans. Inf. Theory 66(4), 2296–2310 (2020)MathSciNetCrossRef
23.
Zurück zum Zitat Mesnager, S.: Linear codes with few weights from weakly regular bent functions based on a generic construction. Cryptogr. Commun. 9(1), 71–84 (2017)MathSciNetCrossRef Mesnager, S.: Linear codes with few weights from weakly regular bent functions based on a generic construction. Cryptogr. Commun. 9(1), 71–84 (2017)MathSciNetCrossRef
24.
Zurück zum Zitat Tang, C., Xiang, C., Feng, K.: Linear codes with few weights from inhomogeneous quadratic functions. Des. Codes Cryptogr. 83(3), 691–714 (2017)MathSciNetCrossRef Tang, C., Xiang, C., Feng, K.: Linear codes with few weights from inhomogeneous quadratic functions. Des. Codes Cryptogr. 83(3), 691–714 (2017)MathSciNetCrossRef
25.
Zurück zum Zitat Tang, C., Li, N., Qi, Y., Zhou, Z., Helleseth, T.: Linear codes with two or three weights from weakly regular bent functions. IEEE Trans. Inf. Theory 62(3), 1166–1176 (2016)MathSciNetCrossRef Tang, C., Li, N., Qi, Y., Zhou, Z., Helleseth, T.: Linear codes with two or three weights from weakly regular bent functions. IEEE Trans. Inf. Theory 62(3), 1166–1176 (2016)MathSciNetCrossRef
27.
Zurück zum Zitat Zhou, Z., Ding, C., Luo, J., et al.: And A family of five-weight cyclic codes and their weight enumerators. IEEE Trans. Inf. Theory 59(10), 6674–6682 (2013)MathSciNetCrossRef Zhou, Z., Ding, C., Luo, J., et al.: And A family of five-weight cyclic codes and their weight enumerators. IEEE Trans. Inf. Theory 59(10), 6674–6682 (2013)MathSciNetCrossRef
28.
Zurück zum Zitat Zhou, Z., Ding, C.: Seven classes of three-weight cyclic codes. IEEE Trans. Commun. 61(10), 4120–4126 (2013)CrossRef Zhou, Z., Ding, C.: Seven classes of three-weight cyclic codes. IEEE Trans. Commun. 61(10), 4120–4126 (2013)CrossRef
Metadaten
Titel
Two families of subfield codes with a few weights
verfasst von
Can Xiang
Wenjuan Yin
Publikationsdatum
06.10.2020
Verlag
Springer US
Erschienen in
Cryptography and Communications / Ausgabe 1/2021
Print ISSN: 1936-2447
Elektronische ISSN: 1936-2455
DOI
https://doi.org/10.1007/s12095-020-00457-9

Weitere Artikel der Ausgabe 1/2021

Cryptography and Communications 1/2021 Zur Ausgabe

Premium Partner