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\).
Similar content being viewed by others
Notes
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]).
References
Arasu, K.T., Sehgal, S.: Cyclic difference covers. Aust. J. Commun. 32, 213–223 (2005)
Buratti, M.: Pairwise balanced designs from finite fields. Discret. Math. 208/209, 103–117 (1999)
Buratti, M.: Old and new designs via strong difference families. J. Combin. Des. 7, 406–425 (1999)
Buratti, M., Gionfriddo, L.: Strong difference families over arbitrary graphs. J. Combin. Des. 16, 443–461 (2008)
Buratti, M., Pasotti, A.: Combinatorial designs and the theorem of Weil on multiplicative character sums. Finite Fields Appl. 15, 332–344 (2009)
Buratti, M., Yan, J., Wang, C.: From a 1-rotational RBIBD to a partitioned difference family. Electron. J. Comb. 17, ♯ R139 (2010)
Buratti, M.: On disjoint \(\phantom {\dot {i}\!}(v,k,k-1)\) difference families. arXiv:1705.04844
Costa, S., Feng, T., Wang, X.: New 2-designs from strong difference families. Finite Fields Appl. 50, 391–405 (2018)
Costa, S., Feng, T., Wang, X.: Frame difference families and resolvable balanced incomplete block designs. To appear in Des. Codes Crypt.
Ding, C., Yin, J.: Combinatorial constructions of optimal constant composition codes. IEEE Trans. Inf. Theory 51, 3671–3674 (2005)
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)
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)
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)
Momihara, K.: Strong difference families, difference covers, and their applications for relative difference families. Des. Codes Crypt. 51, 253–273 (2009)
Paterson, M.B., Stinson, D.R.: Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families. Discret. Math. 339, 2891–2906 (2016)
Szabo, S., Sands, A.: Factoring Groups into Subsets. Chapman and Hall/CRC, Boca Raton (2009)
Wang, Q., Zhou, Y.: Sets of zero-difference balanced functions and their applications. Adv. Math. Commun. 8, 83–101 (2014)
Yamada, K., Mishima, M., Satoh, J., Jimbo, M.: Multifold factorization of cyclic groups into subsets. submitted
Zhou, Z., Tang, X., Wu, D., Yang, Y.: Some new classes of zero difference balanced functions. IEEE Trans. Inf. Theory 58, 139–145 (2012)
Acknowledgements
This work has been performed under the auspices of the G.N.S.A.G.A. of the C.N.R. (National Research Council) of Italy.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Buratti, M. Hadamard partitioned difference families and their descendants. Cryptogr. Commun. 11, 557–562 (2019). https://doi.org/10.1007/s12095-018-0308-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12095-018-0308-3