Skip to main content
Log in

Williamson matrices up to order 59

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

Abstract

A recent result of Schmidt has brought Williamson matrices back into the spotlight. In this article, a new algorithm is introduced to search for hard to find Williamson matrices. We find all nonequivalent Williamson matrices of odd order n up to n = 59. It turns out that there are none for n = 35, 47, 53, 59 and it seems that the Turyn class may be the only infinite class of these matrices.

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

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to H. Kharaghani.

Additional information

Communicated by C.J. Colbourn.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Holzmann, W.H., Kharaghani, H. & Tayfeh-Rezaie, B. Williamson matrices up to order 59. Des. Codes Cryptogr. 46, 343–352 (2008). https://doi.org/10.1007/s10623-007-9163-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-007-9163-5

Keywords

AMS Classification

Navigation