Skip to main content
Log in

An exponent bound on skew Hadamard abelian difference sets

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

Abstract

A difference setD in a groupG is called a skew Hadamard difference set (or an antisymmetric difference set) if and only ifG is the disjoint union ofD, D(−1), and {1}, whereD(−1)={d−1|d∈D}. In this note, we obtain an exponent bound for non-elementary abelian groupG which admits a skew Hadamard difference set. This improves the bound obtained previously by Johnsen, Camion and Mann.

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. Camion, P., and Mann, H. B. 1972. Antisymmetric difference sets.J. Number Theory 4:266–268.

    Google Scholar 

  2. Johnsen, E. C. 1966. Skew-Hadamard abelian group difference sets.J. Algebra 4:388–402.

    Google Scholar 

  3. Jungnickel, D. 1992. Difference sets. In J. Dinitz, D. R. Stinson, editors,Contemporary Design Theory, A Collection of Surveys, pp. 241–324. Wiley-Interscience Series in Discrete Mathematics and Optimization. New York: Wiley.

    Google Scholar 

  4. Jungnickel, D. 1990. λ-ovals and difference sets. In R. Bodendieck, editor.Contemporary Methods in Graph Theory. Mannheim: Bibliographisches Institut.

    Google Scholar 

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

    Google Scholar 

  6. Lang, S. 1970.Algebraic Number Theory. Springer-Verlag.

  7. Paley, R. E. A. C. 1933. On orthogonal matrices.J. Math. Phys. MIT 12:311–320.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, Y.Q., Xiang, Q. & Sehgal, S.K. An exponent bound on skew Hadamard abelian difference sets. Des Codes Crypt 4, 313–317 (1994). https://doi.org/10.1007/BF01388647

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation