Skip to main content
Log in

Difference sets in dihedral groups

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

Abstract

We study the existence of nontrivial (2m, k, λ)-difference sets in dihedral groups. Some nonexistence results are proved. In particular, we show that n = k − λ is odd and ϕ(n)/n < 1/2. Finally, a computer search shows that, except 5 undecided cases, no nontrivial difference set exists in dihedral groups for n ≤ 106.

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

  • Baumert, L.D. 1971. Cyclic Difference Sets. New York: Springer-Verlag.

    Google Scholar 

  • Beth, T., Jungnickel, D., and Lenz, H. 1986. Design Theory. Cambridge: Cambridge University Press.

    Google Scholar 

  • Fan, C.T., Siu, M.K., and Ma, S.L. 1985. Difference Sets in dihedral groups and interlocking difference sets. Ars Combinatoria, 20A:99–107.

    Google Scholar 

  • Lander, E.S., 1983. Symmetric Designs: An Algebraic Approach, Cambridge: Cambridge University Press.

    Google Scholar 

  • Ma, S.L. 1984. On rational circulants satisfying A m = dl + λ J. Linear Algebra Appl, 62:155–161.

    Google Scholar 

  • McFarland, R.L. and Ma, S.L. 1990. Abelian difference sets with multiplier minus one. Arch. Math., 54:610–623.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by D. Jungnickel

Rights and permissions

Reprints and permissions

About this article

Cite this article

Leung, K.H., Ma, S.L. & Wong, Y.L. Difference sets in dihedral groups. Des Codes Crypt 1, 333–338 (1991). https://doi.org/10.1007/BF00124608

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00124608

Keywords

Navigation