Skip to main content
Erschienen in: Cryptography and Communications 4/2019

25.04.2018

Hadamard partitioned difference families and their descendants

Erschienen in: Cryptography and Communications | Ausgabe 4/2019

Einloggen

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

search-config
loading …

Abstract

If D is a \(\phantom {\dot {i}\!}(4u^{2},2u^{2}-u,u^{2}-u)\) Hadamard difference set (HDS) in G, then \(\phantom {\dot {i}\!}\{G,G\setminus D\}\) is clearly a \(\phantom {\dot {i}\!}(4u^{2},[2u^{2}-u,2u^{2}+u],2u^{2})\) partitioned difference family (PDF). Any \(\phantom {\dot {i}\!}(v,K,\lambda )\)-PDF will be said a Hadamard PDF if \(\phantom {\dot {i}\!}v=2\lambda \) as the one above. We present a doubling construction which, starting from any Hadamard PDF, leads to an infinite class of PDFs. As a special consequence, we get a PDF in a group of order \(\phantom {\dot {i}\!}4u^{2}(2n+1)\) and three block-sizes \(\phantom {\dot {i}\!}4u^{2}-2u\), \(\phantom {\dot {i}\!}4u^{2}\) and \(\phantom {\dot {i}\!}4u^{2}+2u\), whenever we have a \(\phantom {\dot {i}\!}(4u^{2},2u^{2}-u,u^{2}-u)\)-HDS and the maximal prime power divisors of \(\phantom {\dot {i}\!}2n+1\) are all greater than \(\phantom {\dot {i}\!}4u^{2}+2u\).

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!

Fußnoten
1
The patterned starter of an additive group H of odd order is the set of all possible pairs \(\phantom {\dot {i}\!}\{h,-h\}\) of opposite elements of \(\phantom {\dot {i}\!}H\setminus \{0\}\) (see, e.g., [11]).
 
Literatur
1.
5.
Zurück zum Zitat Buratti, M., Pasotti, A.: Combinatorial designs and the theorem of Weil on multiplicative character sums. Finite Fields Appl. 15, 332–344 (2009)MathSciNetCrossRefMATH Buratti, M., Pasotti, A.: Combinatorial designs and the theorem of Weil on multiplicative character sums. Finite Fields Appl. 15, 332–344 (2009)MathSciNetCrossRefMATH
6.
Zurück zum Zitat Buratti, M., Yan, J., Wang, C.: From a 1-rotational RBIBD to a partitioned difference family. Electron. J. Comb. 17, ♯ R139 (2010)MathSciNetMATH Buratti, M., Yan, J., Wang, C.: From a 1-rotational RBIBD to a partitioned difference family. Electron. J. Comb. 17, R139 (2010)MathSciNetMATH
7.
Zurück zum Zitat Buratti, M.: On disjoint \(\phantom {\dot {i}\!}(v,k,k-1)\) difference families. arXiv:1705.04844 Buratti, M.: On disjoint \(\phantom {\dot {i}\!}(v,k,k-1)\) difference families. arXiv:1705.​04844
8.
9.
Zurück zum Zitat Costa, S., Feng, T., Wang, X.: Frame difference families and resolvable balanced incomplete block designs. To appear in Des. Codes Crypt. Costa, S., Feng, T., Wang, X.: Frame difference families and resolvable balanced incomplete block designs. To appear in Des. Codes Crypt.
10.
Zurück zum Zitat Ding, C., Yin, J.: Combinatorial constructions of optimal constant composition codes. IEEE Trans. Inf. Theory 51, 3671–3674 (2005)MathSciNetCrossRefMATH Ding, C., Yin, J.: Combinatorial constructions of optimal constant composition codes. IEEE Trans. Inf. Theory 51, 3671–3674 (2005)MathSciNetCrossRefMATH
11.
Zurück zum Zitat Dinitz, J.H.: Starters. In: Colbourn, C.J., Dinitz, J.H. (eds.) Handbook of Combinatorial Designs. 2nd edn., pp 622–628. Chapman & Hall/CRC, Boca Raton (2006) Dinitz, J.H.: Starters. In: Colbourn, C.J., Dinitz, J.H. (eds.) Handbook of Combinatorial Designs. 2nd edn., pp 622–628. Chapman & Hall/CRC, Boca Raton (2006)
12.
Zurück zum Zitat Jungnickel, D., Pott, A., Smith, K.W: Difference sets. In: Colbourn, C.J., Dinitz, J.H. (eds.) Handbook of Combinatorial Designs. 2nd edn., pp 419–435. Chapman & Hall/CRC, Boca Raton (2006) Jungnickel, D., Pott, A., Smith, K.W: Difference sets. In: Colbourn, C.J., Dinitz, J.H. (eds.) Handbook of Combinatorial Designs. 2nd edn., pp 419–435. Chapman & Hall/CRC, Boca Raton (2006)
13.
Zurück zum Zitat Li, S., Wei, H., Ge, G.: Generic constructions for partitioned difference families with applications: a unified combinatorial approach. Des. Codes Crypt. 82, 583–599 (2017)MathSciNetCrossRefMATH Li, S., Wei, H., Ge, G.: Generic constructions for partitioned difference families with applications: a unified combinatorial approach. Des. Codes Crypt. 82, 583–599 (2017)MathSciNetCrossRefMATH
14.
Zurück zum Zitat Momihara, K.: Strong difference families, difference covers, and their applications for relative difference families. Des. Codes Crypt. 51, 253–273 (2009)MathSciNetCrossRefMATH Momihara, K.: Strong difference families, difference covers, and their applications for relative difference families. Des. Codes Crypt. 51, 253–273 (2009)MathSciNetCrossRefMATH
15.
Zurück zum Zitat Paterson, M.B., Stinson, D.R.: Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families. Discret. Math. 339, 2891–2906 (2016)MathSciNetCrossRefMATH Paterson, M.B., Stinson, D.R.: Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families. Discret. Math. 339, 2891–2906 (2016)MathSciNetCrossRefMATH
16.
Zurück zum Zitat Szabo, S., Sands, A.: Factoring Groups into Subsets. Chapman and Hall/CRC, Boca Raton (2009)CrossRefMATH Szabo, S., Sands, A.: Factoring Groups into Subsets. Chapman and Hall/CRC, Boca Raton (2009)CrossRefMATH
17.
18.
Zurück zum Zitat Yamada, K., Mishima, M., Satoh, J., Jimbo, M.: Multifold factorization of cyclic groups into subsets. submitted Yamada, K., Mishima, M., Satoh, J., Jimbo, M.: Multifold factorization of cyclic groups into subsets. submitted
19.
Zurück zum Zitat Zhou, Z., Tang, X., Wu, D., Yang, Y.: Some new classes of zero difference balanced functions. IEEE Trans. Inf. Theory 58, 139–145 (2012)MathSciNetCrossRefMATH Zhou, Z., Tang, X., Wu, D., Yang, Y.: Some new classes of zero difference balanced functions. IEEE Trans. Inf. Theory 58, 139–145 (2012)MathSciNetCrossRefMATH
Metadaten
Titel
Hadamard partitioned difference families and their descendants
Publikationsdatum
25.04.2018
Erschienen in
Cryptography and Communications / Ausgabe 4/2019
Print ISSN: 1936-2447
Elektronische ISSN: 1936-2455
DOI
https://doi.org/10.1007/s12095-018-0308-3

Weitere Artikel der Ausgabe 4/2019

Cryptography and Communications 4/2019 Zur Ausgabe