Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Hadamard partitioned difference families and their descendants

  • Published:
Cryptography and Communications Aims and scope Submit manuscript

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\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Notes

  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]).

References

  1. Arasu, K.T., Sehgal, S.: Cyclic difference covers. Aust. J. Commun. 32, 213–223 (2005)

    MathSciNet  MATH  Google Scholar 

  2. Buratti, M.: Pairwise balanced designs from finite fields. Discret. Math. 208/209, 103–117 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  3. Buratti, M.: Old and new designs via strong difference families. J. Combin. Des. 7, 406–425 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  4. Buratti, M., Gionfriddo, L.: Strong difference families over arbitrary graphs. J. Combin. Des. 16, 443–461 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  5. Buratti, M., Pasotti, A.: Combinatorial designs and the theorem of Weil on multiplicative character sums. Finite Fields Appl. 15, 332–344 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Buratti, M., Yan, J., Wang, C.: From a 1-rotational RBIBD to a partitioned difference family. Electron. J. Comb. 17, R139 (2010)

    MathSciNet  MATH  Google Scholar 

  7. Buratti, M.: On disjoint \(\phantom {\dot {i}\!}(v,k,k-1)\) difference families. arXiv:1705.04844

  8. Costa, S., Feng, T., Wang, X.: New 2-designs from strong difference families. Finite Fields Appl. 50, 391–405 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  9. Costa, S., Feng, T., Wang, X.: Frame difference families and resolvable balanced incomplete block designs. To appear in Des. Codes Crypt.

  10. Ding, C., Yin, J.: Combinatorial constructions of optimal constant composition codes. IEEE Trans. Inf. Theory 51, 3671–3674 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  11. 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. 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. 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)

    Article  MathSciNet  MATH  Google Scholar 

  14. Momihara, K.: Strong difference families, difference covers, and their applications for relative difference families. Des. Codes Crypt. 51, 253–273 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  15. Paterson, M.B., Stinson, D.R.: Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families. Discret. Math. 339, 2891–2906 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  16. Szabo, S., Sands, A.: Factoring Groups into Subsets. Chapman and Hall/CRC, Boca Raton (2009)

    Book  MATH  Google Scholar 

  17. Wang, Q., Zhou, Y.: Sets of zero-difference balanced functions and their applications. Adv. Math. Commun. 8, 83–101 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  18. Yamada, K., Mishima, M., Satoh, J., Jimbo, M.: Multifold factorization of cyclic groups into subsets. submitted

  19. Zhou, Z., Tang, X., Wu, D., Yang, Y.: Some new classes of zero difference balanced functions. IEEE Trans. Inf. Theory 58, 139–145 (2012)

    Article  MathSciNet  MATH  Google Scholar 

Download references

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

Authors

Corresponding author

Correspondence to Marco Buratti.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12095-018-0308-3

Keywords

Mathematics Subject Classification (2010)