Skip to main content
Erschienen in: Applicable Algebra in Engineering, Communication and Computing 1/2021

29.08.2019 | Original Paper

Complete weight enumerators of two classes of linear codes with a few weights

verfasst von: Minglong Qi, Shengwu Xiong

Erschienen in: Applicable Algebra in Engineering, Communication and Computing | Ausgabe 1/2021

Einloggen

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

search-config
loading …

Abstract

Linear codes with a few weights have important applications in secret sharing, authentication codes, data storage system, association schemes, and strongly regular graphs. Hence, the construction of linear codes with a few weights is an important research topic in coding theory. In this paper, we construct two new classes of linear codes with two and three weights, and determine their complete weight enumerators. Our work generalizes the results of Wang et al. (Discret Math 340(3):467–480, 2017).

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 "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!

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!

Literatur
1.
Zurück zum Zitat Carlet, C., Ding, C., Yuan, J.: Linear codes from perfect nonlinear mappings and their secret sharing schemes. IEEE Trans. Inf. Theory 51(6), 2089–2102 (2005)MathSciNetCrossRef Carlet, C., Ding, C., Yuan, J.: Linear codes from perfect nonlinear mappings and their secret sharing schemes. IEEE Trans. Inf. Theory 51(6), 2089–2102 (2005)MathSciNetCrossRef
2.
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
3.
Zurück zum Zitat Yuan, J., Ding, C.: Secret sharing schemes from three classes of linear codes. IEEE Trans. Inf. Theory 52(1), 206–212 (2006)MathSciNetCrossRef Yuan, J., Ding, C.: Secret sharing schemes from three classes of linear codes. IEEE Trans. Inf. Theory 52(1), 206–212 (2006)MathSciNetCrossRef
4.
Zurück zum Zitat Ding, C., Helleseth, T., Klove, T., Wang, X.: A generic construction of Cartesian au-thentication codes. IEEE Trans. Inf. Theory 53(6), 2229–2235 (2007)CrossRef Ding, C., Helleseth, T., Klove, T., Wang, X.: A generic construction of Cartesian au-thentication codes. IEEE Trans. Inf. Theory 53(6), 2229–2235 (2007)CrossRef
5.
Zurück zum Zitat Calderbank, A.R., Goethals, J.M.: Three-weight codes and association schemes. Philips J. Res. 39, 143–152 (1984)MathSciNetMATH Calderbank, A.R., Goethals, J.M.: Three-weight codes and association schemes. Philips J. Res. 39, 143–152 (1984)MathSciNetMATH
6.
Zurück zum Zitat Calderbank, A.R., Kantor, W.M.: The geometry of two-weight codes. Bull. Lond. Math. Soc. 18(2), 97–122 (1986)MathSciNetCrossRef Calderbank, A.R., Kantor, W.M.: The geometry of two-weight codes. Bull. Lond. Math. Soc. 18(2), 97–122 (1986)MathSciNetCrossRef
7.
Zurück zum Zitat Blake, I.F., Kith, K.: On the complete weight enumerator of Reed–Solomon codes. SIAM J. Discret. Math. 4(2), 164–171 (1991)MathSciNetCrossRef Blake, I.F., Kith, K.: On the complete weight enumerator of Reed–Solomon codes. SIAM J. Discret. Math. 4(2), 164–171 (1991)MathSciNetCrossRef
8.
Zurück zum Zitat Kith K.: Complete weight enumeration of Reed–Solomon codes. Master’s thesis, Department of Electrical and Computing Engineering, University of Waterloo, Waterloo (1989) Kith K.: Complete weight enumeration of Reed–Solomon codes. Master’s thesis, Department of Electrical and Computing Engineering, University of Waterloo, Waterloo (1989)
9.
Zurück zum Zitat Kuzmin, A., Nechaev, A.: Complete weight enumerators of generalized Kerdock code and linear recursive codes over Galois ring. In: Workshop on Coding and Cryptography, pp. 333–336 (1999) Kuzmin, A., Nechaev, A.: Complete weight enumerators of generalized Kerdock code and linear recursive codes over Galois ring. In: Workshop on Coding and Cryptography, pp. 333–336 (1999)
10.
Zurück zum Zitat Kuzmin, A., Nechaev, A.: Complete weight enumerators of generalized Kerdock code and related linear codes over Galois ring. Discret. Appl. Math. 111(1), 117–137 (2001)MathSciNetCrossRef Kuzmin, A., Nechaev, A.: Complete weight enumerators of generalized Kerdock code and related linear codes over Galois ring. Discret. Appl. Math. 111(1), 117–137 (2001)MathSciNetCrossRef
11.
Zurück zum Zitat Li, C., Bae, S., Ahn, J., Yang, S., Yao, Z.: Complete weight enumerators of some linear codes and their applications. Des. Codes Cryptogr. 81(1), 153–168 (2016)MathSciNetCrossRef Li, C., Bae, S., Ahn, J., Yang, S., Yao, Z.: Complete weight enumerators of some linear codes and their applications. Des. Codes Cryptogr. 81(1), 153–168 (2016)MathSciNetCrossRef
12.
Zurück zum Zitat Tang, C.M., Qi, Y.F., Huang, D.M.: Two-weight and three-weight linear codes from square functions. IEEE Commun. Lett. 20(1), 29–32 (2016)CrossRef Tang, C.M., Qi, Y.F., Huang, D.M.: Two-weight and three-weight linear codes from square functions. IEEE Commun. Lett. 20(1), 29–32 (2016)CrossRef
13.
Zurück zum Zitat Wang, Q., Li, F., Ding, K., Lin, D.: Complete weight enumerators of two classes of linear codes. Discret. Math. 340(3), 467–480 (2017)MathSciNetCrossRef Wang, Q., Li, F., Ding, K., Lin, D.: Complete weight enumerators of two classes of linear codes. Discret. Math. 340(3), 467–480 (2017)MathSciNetCrossRef
14.
Zurück zum Zitat Yang, S., Yao, Z.A.: Complete weight enumerators of a family of three-weight linear codes. Des. Codes Cryptogr. 82(3), 663–674 (2017)MathSciNetCrossRef Yang, S., Yao, Z.A.: Complete weight enumerators of a family of three-weight linear codes. Des. Codes Cryptogr. 82(3), 663–674 (2017)MathSciNetCrossRef
15.
Zurück zum Zitat Zhang, D., Fan, C.L., Peng, D.Y., Tang, X.H.: Complete weight enumerators of some linear codes from quadratic forms. Cryptogr. Commun. 9(1), 151–163 (2017)MathSciNetCrossRef Zhang, D., Fan, C.L., Peng, D.Y., Tang, X.H.: Complete weight enumerators of some linear codes from quadratic forms. Cryptogr. Commun. 9(1), 151–163 (2017)MathSciNetCrossRef
16.
Zurück zum Zitat Zhou, Z., Li, N., Fan, C.L., Helleseth, T.: Linear codes with two or three weights from quadratic Bent functions. Des. Codes Cryptogr. 81(2), 283–295 (2016)MathSciNetCrossRef Zhou, Z., Li, N., Fan, C.L., Helleseth, T.: Linear codes with two or three weights from quadratic Bent functions. Des. Codes Cryptogr. 81(2), 283–295 (2016)MathSciNetCrossRef
17.
Zurück zum Zitat Helleseth, T., Kholosha, A.: Monomial and quadratic bent functions over the finite fields of odd characteristic. IEEE Trans. Inf. 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. Inf. Theory 52(5), 2018–2032 (2006)MathSciNetCrossRef
18.
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
19.
Zurück zum Zitat Ding, K., Ding, C.: Bianry linear codes with three weights. IEEE Commun. Lett. 18(11), 1879–1882 (2014)CrossRef Ding, K., Ding, C.: Bianry linear codes with three weights. IEEE Commun. Lett. 18(11), 1879–1882 (2014)CrossRef
20.
Zurück zum Zitat Coulter, R.S., Matthews, R.W.: Planar functions and planes of Lenz-Barlotti class II. Des. Codes Cryptogr. 10, 167–184 (1997)MathSciNetCrossRef Coulter, R.S., Matthews, R.W.: Planar functions and planes of Lenz-Barlotti class II. Des. Codes Cryptogr. 10, 167–184 (1997)MathSciNetCrossRef
24.
Zurück zum Zitat Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, New York (1997)MATH Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, New York (1997)MATH
25.
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
27.
Zurück zum Zitat Charpin, P., Helleseth, T., Zinoviev, V.: The divisibility modulo 24 of Kloosterman sums on \( GF(2^{m}), m \) odd. J. Comb. Theory Ser. A 114, 322–338 (2007)CrossRef Charpin, P., Helleseth, T., Zinoviev, V.: The divisibility modulo 24 of Kloosterman sums on \( GF(2^{m}), m \) odd. J. Comb. Theory Ser. A 114, 322–338 (2007)CrossRef
28.
Zurück zum Zitat Deepika M.P., Sreekumar A.: Secret sharing scheme using gray code and XOR operation. In: ICECCT, Coimbatore, pp. 1-5 (2017) Deepika M.P., Sreekumar A.: Secret sharing scheme using gray code and XOR operation. In: ICECCT, Coimbatore, pp. 1-5 (2017)
29.
Zurück zum Zitat Dougherty, S.T., Mesnager, S., Solé, P.: Secret-sharing schemes based on self-dual codes. In: IEEE Information Theory Workshop (2008) Dougherty, S.T., Mesnager, S., Solé, P.: Secret-sharing schemes based on self-dual codes. In: IEEE Information Theory Workshop (2008)
Metadaten
Titel
Complete weight enumerators of two classes of linear codes with a few weights
verfasst von
Minglong Qi
Shengwu Xiong
Publikationsdatum
29.08.2019
Verlag
Springer Berlin Heidelberg
Erschienen in
Applicable Algebra in Engineering, Communication and Computing / Ausgabe 1/2021
Print ISSN: 0938-1279
Elektronische ISSN: 1432-0622
DOI
https://doi.org/10.1007/s00200-019-00401-2

Weitere Artikel der Ausgabe 1/2021

Applicable Algebra in Engineering, Communication and Computing 1/2021 Zur Ausgabe

Premium Partner