Skip to main content
Erschienen in: Cryptography and Communications 5/2020

18.06.2020

Combinatorial t-designs from special functions

verfasst von: Cunsheng Ding, Chunming Tang

Erschienen in: Cryptography and Communications | Ausgabe 5/2020

Einloggen

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

search-config
loading …

Abstract

A special function is a function either of special form or with a special property. Special functions have interesting applications in coding theory and combinatorial t-designs. The main objective of this paper is to survey t-designs constructed from special functions, including quadratic functions, almost perfect nonlinear functions, almost bent functions, bent functions, bent vectorial functions, and planar functions. These combinatorial designs are not constructed directly from such functions, but come from linear codes which are constructed with such functions. As a byproduct, this paper also surveys linear codes from certain special functions.

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
2.
Zurück zum Zitat Canteaut, C., Charpin, P., Dobbertin, H.: Weight divisibility of cyclic codes, highly nonlinear functions on \(f_{2^{m}}\), and crosscorrelation of maximum-length sequences. SIAM J. Discret. Math. 13, 105–138 (1998)CrossRef Canteaut, C., Charpin, P., Dobbertin, H.: Weight divisibility of cyclic codes, highly nonlinear functions on \(f_{2^{m}}\), and crosscorrelation of maximum-length sequences. SIAM J. Discret. Math. 13, 105–138 (1998)CrossRef
3.
Zurück zum Zitat Carlet, C., Charpin, P., Zinoviev, V.: Codes, bent functions and permutations suitable for DES-like cryptosystems. Des. Codes Cryptogr. 15, 125–126 (1998)MathSciNetCrossRef Carlet, C., Charpin, P., Zinoviev, V.: Codes, bent functions and permutations suitable for DES-like cryptosystems. Des. Codes Cryptogr. 15, 125–126 (1998)MathSciNetCrossRef
4.
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, 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, 2089–2102 (2005)MathSciNetCrossRef
5.
Zurück zum Zitat Carlet, C., Mesnager, S.: On the construction of bent vectorial functions. International Journal of Information and Coding Theory 1, 133–148 (2010)MathSciNetCrossRef Carlet, C., Mesnager, S.: On the construction of bent vectorial functions. International Journal of Information and Coding Theory 1, 133–148 (2010)MathSciNetCrossRef
6.
7.
Zurück zum Zitat Cusick, T.W., Dobbertin, H.: Some new three-valued crosscorrelation functions for binary m-sequences. IEEE Trans. Inform. Theory 42, 1238–1240 (1996)MathSciNetCrossRef Cusick, T.W., Dobbertin, H.: Some new three-valued crosscorrelation functions for binary m-sequences. IEEE Trans. Inform. Theory 42, 1238–1240 (1996)MathSciNetCrossRef
9.
Zurück zum Zitat Dillion, J.F., Schatz, J.R.: Block Designs with the Symmetric Difference Property. In: Proc. of the NSA Mathematical Sciences Meetings, (Ward R. L. Ed.), pp. 159–164 (1987) Dillion, J.F., Schatz, J.R.: Block Designs with the Symmetric Difference Property. In: Proc. of the NSA Mathematical Sciences Meetings, (Ward R. L. Ed.), pp. 159–164 (1987)
11.
12.
Zurück zum Zitat Ding, C.: An infinite family of Steiner systems s(2, 4, 2m) from cyclic codes. J. Combinatorial Designs 26, 127–144 (2018)MathSciNetCrossRef Ding, C.: An infinite family of Steiner systems s(2, 4, 2m) from cyclic codes. J. Combinatorial Designs 26, 127–144 (2018)MathSciNetCrossRef
13.
Zurück zum Zitat Ding, C.: Infinite families of t-designs from a type of five-weight codes. Des. Codes Cryptogr. 86, 703–719 (2018)MathSciNetCrossRef Ding, C.: Infinite families of t-designs from a type of five-weight codes. Des. Codes Cryptogr. 86, 703–719 (2018)MathSciNetCrossRef
14.
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
15.
Zurück zum Zitat Ding, C., Li, C.: Infinite families of 2-designs and 3-designs from linear codes. Disc. Math. 340, 2415–2431 (2017)MathSciNetCrossRef Ding, C., Li, C.: Infinite families of 2-designs and 3-designs from linear codes. Disc. Math. 340, 2415–2431 (2017)MathSciNetCrossRef
16.
Zurück zum Zitat Ding, C., Munemasa, A., Tonchev, V.: Bent vectorial functions, codes and designs. arXiv:1808.08487v1 [math.CO] Ding, C., Munemasa, A., Tonchev, V.: Bent vectorial functions, codes and designs. arXiv:1808.​08487v1 [math.CO]
17.
Zurück zum Zitat Du, X., Wang, R., Fan, C.: Infinite families of 2-designs from a class of cyclic codes with two non-zeros. arXiv:1904.04242 [math.CO] Du, X., Wang, R., Fan, C.: Infinite families of 2-designs from a class of cyclic codes with two non-zeros. arXiv:1904.​04242 [math.CO]
18.
Zurück zum Zitat Du, X., Wang, R., Tang, C., Wang, Q.: Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros. arXiv:1903.08153 [math.CO] Du, X., Wang, R., Tang, C., Wang, Q.: Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros. arXiv:1903.​08153 [math.CO]
19.
Zurück zum Zitat Du, X., Wang, R., Tang, C., Wang, Q.: Infinite families of 2-designs from two classes of linear codes. arXiv:1903.07459 [math.CO] Du, X., Wang, R., Tang, C., Wang, Q.: Infinite families of 2-designs from two classes of linear codes. arXiv:1903.​07459 [math.CO]
20.
Zurück zum Zitat Feng, K., Luo, J.: Value distributions of exponential sums from perfect nonlinear functions and their applications. IEEE Trans. Inf. Theory 53, 3053–3041 (2007)MathSciNetCrossRef Feng, K., Luo, J.: Value distributions of exponential sums from perfect nonlinear functions and their applications. IEEE Trans. Inf. Theory 53, 3053–3041 (2007)MathSciNetCrossRef
21.
Zurück zum Zitat Gold, R.: Maximal recursive sequences with 3-valued recursive cross-correlation functions. IEEE Trans. Inf. Theory 14, 154–156 (1967)CrossRef Gold, R.: Maximal recursive sequences with 3-valued recursive cross-correlation functions. IEEE Trans. Inf. Theory 14, 154–156 (1967)CrossRef
22.
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
23.
24.
Zurück zum Zitat Kantor, W.M.: Exponential number of two-weight codes, difference sets and symmetric designs. Disc. Math. 46, 95–98 (1983)MathSciNetCrossRef Kantor, W.M.: Exponential number of two-weight codes, difference sets and symmetric designs. Disc. Math. 46, 95–98 (1983)MathSciNetCrossRef
25.
Zurück zum Zitat Kasami, T.: Weight enumerators for several classes of subcodes of the second order binary Reed-Muller codes. Inf. Control. 18, 369–394 (1971)CrossRef Kasami, T.: Weight enumerators for several classes of subcodes of the second order binary Reed-Muller codes. Inf. Control. 18, 369–394 (1971)CrossRef
26.
Zurück zum Zitat Kasami, T., Lin, S., Peterson, W.W.: Some results on cyclic codes which are invariant under the affine group and their applications. Inf. Control. 11, 475–496 (1968)MathSciNetCrossRef Kasami, T., Lin, S., Peterson, W.W.: Some results on cyclic codes which are invariant under the affine group and their applications. Inf. Control. 11, 475–496 (1968)MathSciNetCrossRef
27.
Zurück zum Zitat MacWilliams, F.J., Sloane, N.J.A.: The theory of Error-Correcting codes. North holland amsterdam (1977) MacWilliams, F.J., Sloane, N.J.A.: The theory of Error-Correcting codes. North holland amsterdam (1977)
28.
Zurück zum Zitat McQuire, G.: Quasi-symmetric designs and codes meeting the Grey-Rankin bound. J. Comb. Theory A 78, 280–291 (1997)MathSciNetCrossRef McQuire, G.: Quasi-symmetric designs and codes meeting the Grey-Rankin bound. J. Comb. Theory A 78, 280–291 (1997)MathSciNetCrossRef
29.
Zurück zum Zitat Mesnager, S.: Bent Functions: Fundamentals and Results. Springer Verlag, Switzerland (2016)CrossRef Mesnager, S.: Bent Functions: Fundamentals and Results. Springer Verlag, Switzerland (2016)CrossRef
31.
Zurück zum Zitat Tonchev, V.D.: Quasi-symmetric designs, codes, quadrics, and hyperplane sections. Geom. Dedicata. 48, 295–308 (1993)MathSciNetCrossRef Tonchev, V.D.: Quasi-symmetric designs, codes, quadrics, and hyperplane sections. Geom. Dedicata. 48, 295–308 (1993)MathSciNetCrossRef
32.
Zurück zum Zitat Van Lint, J.H.: Introduction to Coding Theory, 3rd edn. Springer Verlag, New York (1999)CrossRef Van Lint, J.H.: Introduction to Coding Theory, 3rd edn. Springer Verlag, New York (1999)CrossRef
33.
Zurück zum Zitat Wolfmann, J.: Bent Functions and Coding Theory. In: Difference Sets, Sequences and Their Correlation Properties, A. Pott, P. V. Kumar, T. Helleseth and D. Jungnickel, eds., pp. 393–417. Amsterdam: Kluwer (1999) Wolfmann, J.: Bent Functions and Coding Theory. In: Difference Sets, Sequences and Their Correlation Properties, A. Pott, P. V. Kumar, T. Helleseth and D. Jungnickel, eds., pp. 393–417. Amsterdam: Kluwer (1999)
34.
Zurück zum Zitat Xiang, C., Ding, C., Mesnager, S.: Optimal codebooks from binary codes meeting the Levenshtein bound. IEEE Trans. Inf. Theory 61, 6526–6535 (2015)MathSciNetCrossRef Xiang, C., Ding, C., Mesnager, S.: Optimal codebooks from binary codes meeting the Levenshtein bound. IEEE Trans. Inf. Theory 61, 6526–6535 (2015)MathSciNetCrossRef
35.
Zurück zum Zitat Yuan, J., Carlet, C.: Ding, c: the weight distribution of a class of linear codes from perfect nonlinear functions. IEEE Trans. Inf. Theory 52, 712–717 (2006)CrossRef Yuan, J., Carlet, C.: Ding, c: the weight distribution of a class of linear codes from perfect nonlinear functions. IEEE Trans. Inf. Theory 52, 712–717 (2006)CrossRef
Metadaten
Titel
Combinatorial t-designs from special functions
verfasst von
Cunsheng Ding
Chunming Tang
Publikationsdatum
18.06.2020
Verlag
Springer US
Erschienen in
Cryptography and Communications / Ausgabe 5/2020
Print ISSN: 1936-2447
Elektronische ISSN: 1936-2455
DOI
https://doi.org/10.1007/s12095-020-00442-2

Weitere Artikel der Ausgabe 5/2020

Cryptography and Communications 5/2020 Zur Ausgabe