Skip to main content
Log in

A New Method for Constructing Williamson Matrices

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

Abstract

For every prime power q ≡ 1 (mod 4) we prove the existence of (q; x, y)-partitions of GF(q) with q=x2+4y2 for some x, y, which are very useful for constructing SDS, DS and Hadamard matrices. We discuss the transformations of (q; x,y)-partitions and, by using the partitions, construct generalized cyclotomic classes which have properties similar to those of classical cyclotomic classes. Thus we provide a new construction for Williamson matrices of order q2.

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.

Institutional subscriptions

Similar content being viewed by others

References

  • L. D. Baumert W. H. Mills R. L. Ward (1982) ArticleTitleUniform cyclotomy Journal of Number Theory 14 67–82

    Google Scholar 

  • Y. Q. Chen (1997) ArticleTitleOn the existence of Abelian Hadamard difference sets and a new family of difference sets Finite Fields and their Applications 3 234–256

    Google Scholar 

  • J. A. Davis J. Jedwab A unifying (1997) ArticleTitleconstruction for difference sets Journal of Combinatorial Theory, Series A 80 13–78

    Google Scholar 

  • M. Eupen Particlevan V. D. Tonchev (1997) ArticleTitleLinear codes and the existence of a reversible Hadamard difference set in Z2 × Z2 × Z45 Journal of Combinatorial Theory, Series A 79 161–167

    Google Scholar 

  • M. Hall SuffixJr. (Eds) (1986) Combinatorial Theory EditionNumber2 John Wiley & Sons New York

    Google Scholar 

  • D. Jungnickel (Eds) (1993) Finite Fields: Structure and Arithmetic BI-Wissenschaftsverlag Mannheim

    Google Scholar 

  • S. Lang (Eds) (1986) Algebraic Number Theory Springer-Verlag New York, Berlin

    Google Scholar 

  • R. Lidl H. Niederreiter (Eds) (1994) Introduction to Finite Fields and Their Applications Cambridge Univ. Press Cambridge

    Google Scholar 

  • A. Pott, Finite Geometry and Character Theory, Lecture Notes in Mathematics, Vol. 1601 Springer-Verlag, New York, Berlin (1995).

  • R. J. Turyn (1984) ArticleTitleA special class of Williamson matrices and difference sets Journal of Combinatorial Theory, Series A 36 111–115

    Google Scholar 

  • A. L. Whiteman (1973) ArticleTitleAn infinite family of Hadamard matrices of Williamson type Journal of Combinatorial Theory, Series A 14 334–340

    Google Scholar 

  • R. M. Wilson Q. Xiang (1997) ArticleTitleConstructions of Hadamard difference sets Journal of Combinatorial Theory, Series A 77 148–160

    Google Scholar 

  • M. Xia G. Liu (1991) ArticleTitleAn infinite class of supplementary difference sets and Williamson matrices Journal of Combinatorial Theory, Series A 58 310–317

    Google Scholar 

  • M. Xia (1992) ArticleTitleSome infinite classes of special Williamson matrices and difference sets Journal of Combinatorial Theory, Series A 61 230–242

    Google Scholar 

  • M. Xia, Williamson matrices and difference sets, in Group, Difference sets and the Monster, Walter de Gruyter, Berlin, New York (1996), pp. 233–237.

  • M. Xia G. Liu A new (1996) ArticleTitlefamily of supplementary difference sets and Hadamard matrices Stat. Plan. Inf. 51 283–291

    Google Scholar 

  • Q. Xiang (1998) ArticleTitleDifference Families from lines and half Lines European Journal of Combinatorics 19 395–400

    Google Scholar 

  • Q. Xiang Y. Q. Chen (1996) ArticleTitleOn Xia’s construction of Hadamard difference sets Finite Fields and their Applications 2 87–95

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mingyuan Xia.

Additional information

The research supported by NSF of China (No. 10071029).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xia, M., Xia, T. & Seberry, J. A New Method for Constructing Williamson Matrices. Des Codes Crypt 35, 191–209 (2005). https://doi.org/10.1007/s10623-005-6401-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-005-6401-6

Keywords

Navigation