Skip to main content
Log in

A Family of Semi-Regular Divisible Difference Sets

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

We give a construction of semi-regular divisible difference sets with parameters

m = p2a(r−1)+2b (pr − 1)/(p − 1), n = pr, k = p(2a+1)(r−1)+2b (pr − 1)/(p − 1)

λ1 = p(2a+1)(r−1)+2b (pr−1 − 1)/(p-1), λ2 = p2(a+1)(r−1)−r+2b (pr − 1)/(p − 1)

where p is a prime and r ≥ a + 1.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J. A. Davis, New construction of divisible designs, Discrete Math., Vol. 120 (1993) pp. 261–268.

    Google Scholar 

  2. J. A. Davis and J. Jedwab, A note on new semi-regular divisible difference sets, Designs, Codes and Crytography, Vol. 3 (1993) pp. 379–381.

    Google Scholar 

  3. D. Jungnickel, On automorphism groups of divisible designs, Can. J. Math., Vol. 24 (1982) pp. 257–297.

    Google Scholar 

  4. R. L. McFarland, A family of difference sets in non-cyclic groups, J. Combin. Theory Ser. A, Vol. 15 (1973) pp. 1–10.

    Google Scholar 

  5. A. Pott, Finite Geometry and Character Theory, Springer, Berlin/Heidelberg/New York (1995).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ma, S.L., Sehgal, S.K. A Family of Semi-Regular Divisible Difference Sets. Designs, Codes and Cryptography 11, 73–78 (1997). https://doi.org/10.1023/A:1008203025476

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008203025476

Navigation