Abstract
In 2008 Holzmann et al. introduced a new algorithm to search for symmetric circulant Williamson matrices. We adapted the algorithm for Turyn type Williamson matrices. For each order up to 99 where Turyn type Williamson matrices exist our computer search found, up to equivalence, exactly one such matrix.
Similar content being viewed by others
References
Colbourn, C.J., Dinitz, J.H. (eds): The CRC Handbook of Combinatorial Designs, pp. 274–276. CRC Press, Boca Raton (2007)
Holzmann W.H., Kharaghani H., Tayfeh-Rezaie B.: Williamson matrices up to order 59. Des. Codes Cryptogr. 46, 343–352 (2008)
Doković D.Ž.: Williamson matrices of order 4n for n = 33, 35, 39. Discret. Math. 115, 267–271 (1993)
Horton J., Koukouvinos C., Seberry J.: A search for Hadamard matrices constructed from Williamson matrices. Bull. Inst. Combin. Appl. 35, 75–88 (2002)
Turyn R.J.: An infinite class of Williamson matrices. J. Combin. Theory Ser. A 12, 319–321 (1972)
Koukouvinos C.: http://www.math.ntua.gr/~ckoukouv.
Knuth D.E.: The Art of Computer Programming, Vol. 4, fascicle 3, pp. 8–14. Pearson Education Inc., Hong Kong (2005)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by C. J. Colbourn.
Rights and permissions
About this article
Cite this article
Lang, W., Schneider, E. Turyn type Williamson matrices up to order 99. Des. Codes Cryptogr. 62, 79–84 (2012). https://doi.org/10.1007/s10623-011-9492-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-011-9492-2