betaFeedback

WorksMathematics

Hadamard matrices of orders 668, 716, 892, 1132, 1244, 1388, 1436, 1676, 1772, 1916, 1948 and 1964

Abstract

We construct Hadamard matrices of orders 668, 716, 892, 1132, 1244, 1388, 1436, 1676, 1772, 1916, 1948 and 1964, the twelve multiples of 4 below 2000 for which none was known, and a second, inequivalent matrix of order 668. Five come from the Goethals–Seidel array with circulant blocks invariant under a multiplier group, four from the width-4 bordered array of Wallis and Whiteman, and four from bordered Goethals–Seidel arrays of widths 12, 20 and 28 whose corner is itself a Hadamard matrix. To our knowledge borders wider than 4 with a Hadamard corner are new; the first two arrays are classical. The four matrices with a border of width 4, of orders 668, 716, 1676 and 1772, are instances of a theorem of Miyamoto on Hadamard matrices of order 8m+48m+4, which Seberry and Yamada restated with their M-structures; the matrices to which the theorem applies were found here by computer search. The searches differ greatly in size. Those for the wider borders formed at most about 2442^{44} pairs of candidate blocks. Those for orders 716 and 668 with a border of width 4, made with no multiplier group, formed about 2662^{66} and 2592^{59}, and these two matrices, that of order 716 above all, are results of large-scale computation more than of a new construction. With these matrices, a Hadamard matrix of order nn is known for every n≡0(mod4)n\equiv 0\pmod 4 with n≤2000n\le 2000.

Introduction

The result

A Hadamard matrix of order nn is an n×nn \times n matrix HH with entries ±1\pm1 and HHT=nInHH^{\mathrm{T}} = nI_n [31]. The Hadamard conjecture, usually attributed to Paley [59], is that one exists for every nn divisible by 4. By 2014 the multiples of 4 up to 2000 for which none was known were 4v4v for the twelve primes v=167,179,223,283,311,347,359,419,443,479,487,491v = 167, 179, 223, 283, 311, 347, 359, 419, 443, 479, 487, 491 [7, 12, 20, 58, 65, 67].1 The list has not changed since then [7, 19]. Its smallest member, 668, had been the least order in doubt since Kharaghani and Tayfeh-Rezaie constructed order 428 in 2004 [36]. It was the subject of recent partial results [24, 60] and of a conjecture that would give a matrix of this order through a Legendre pair of length 333 [38 Conj. 1] (§7). We give a Hadamard matrix of each of the twelve orders, and a second, inequivalent one of order 668, labelled 668′ below (Table 1).

Theorem 1 (Twelve new orders). Hadamard matrices of orders 668, 716, 892, 1132, 1244, 1388, 1436, 1676, 1772, 1916, 1948 and 1964 exist.

The proof is a finite verification: Tables A1–A2 determine one matrix of each order explicitly, through (1), Proposition 2 and Theorem 5, and [83] gives them in machine-readable form (§6). The printed matrices differ from the files released publicly earlier [1] only in the conventions stated in §6.2, except that 668′ is not among those files. Consequently a Hadamard matrix of order nn is known for every n≡0(mod4)n \equiv0 \pmod{4} with n≤2000n \leq2000. Egan, Kotsireas, London and Ó Catháin [23] have analysed the structure of the twelve released matrices, working from the matrices alone. Their paper is also a survey of how Hadamard matrices are constructed and of the orders each method reaches, a far broader landscape than the present one; it counts 95 orders up to 10 000 as still open when it appeared, the least being 2396 =4⋅599= 4 \cdot599. Readers who want the context in which the twelve orders sit should start there.

The main idea

Let GG be a finite abelian group and let a1,…,a4:G→{±1}a_1,\ldots,a_4:G\to\{\pm1\} be four functions, the blocks. Write PSD⁡(χ)=∑f∣af^(χ)∣2\operatorname{PSD}(\chi)=\sum_f|\widehat{a_f}(\chi)|^2 for their total power spectrum, where a^\widehat{a} is the discrete Fourier transform on GG and the characters χ\chi are the frequencies (§ 1.5). The Goethals–Seidel array KK of § 2 is a ±1\pm1 matrix of order 4∣G∣4|G| with KKT=I4⊗∑fAfAfTKK^{\mathsf T}=I_4\otimes\sum_f A_fA_f^{\mathsf T}, where Af=(af(y−x))x,yA_f=(a_f(y-x))_{x,y} is the group matrix of afa_f, the GG-circulant matrix it generates, and the eigenvalues of ∑fAfAfT\sum_f A_fA_f^{\mathsf T} are the numbers PSD⁡(χ)\operatorname{PSD}(\chi). So KK is a Hadamard matrix exactly when the spectrum is flat: PSD⁡(χ)=4∣G∣\operatorname{PSD}(\chi)=4|G| for every character χ\chi.

All twelve orders are n=4vn=4v with vv prime, and the standard method takes G=ZvG=\mathbb{Z}_v. A group of prime order has no proper non-trivial subgroup, hence no quotient to work through, and the structure the standard method imposes is invariance of each afa_f under a group MM of multipliers (maps x↦hxx\mapsto hx of Zv\mathbb{Z}_v), of odd order t>1t>1 dividing v−1v-1. Invariance forces every row sum rf=∑xaf(x)r_f=\sum_xa_f(x) to be ≡±1(mod2t)\equiv\pm1\pmod{2t}, because the non-zero elements fall into (v−1)/t(v-1)/t orbits of size tt, an even number of them, and flatness at the trivial character forces r12+⋯+r42=4vr_1^2+\cdots+r_4^2=4v. For five of the twelve primes the two demands are compatible for some tt, and the known method succeeds (§ 5.1).

For the other seven primes no row sums suitable for that method exist, and we use bordered Goethals–Seidel arrays: a Goethals–Seidel array over an abelian group GG of order slightly less than vv, surrounded by a border of bb rows and columns, its width (Figure 1). We call its four blocks the core. Unlike vv, the order ∣G∣=v−b/4|G|=v-b/4 can have several small factors (§ 5).

The bordered Goethals–Seidel array

Figure 1. The bordered array HH. Each row of EE and each column of DD has four segments, constant on the cosets of NN and summing to zero. Below: the first row of EE for q=4q=4 with the frame of Table 2; ±k\pm^k is kk equal signs, k=41k=41 for order 668′.

A border can repair a spectrum that is flat except at a few characters. Let NN be a subgroup of GG of even index qq, take b=4(q−1)b=4(q-1), so that ∣G∣=v−(q−1)|G|=v-(q-1), and ask that PSD⁡(χ)=n\operatorname{PSD}(\chi)=n at every character except the q−1q-1 non-trivial characters of the quotient Q=G/NQ=G/N. If PSD⁡\operatorname{PSD} has a common value at those, Parseval’s identity forces that value to be bb. (Parseval gives ∑χPSD⁡(χ)=4∣G∣2\sum_\chi\operatorname{PSD}(\chi)=4|G|^2; with the value n=4∣G∣+bn=4|G|+b at the other ∣G∣−q+1|G|-q+1 characters, a common value cc at these q−1q-1 must satisfy (q−1)(n−c)=∣G∣b=4(q−1)∣G∣(q-1)(n-c)=|G|b=4(q-1)|G|, that is, c=n−4∣G∣=bc=n-4|G|=b.) Then nI−KKTnI-KK^{\mathsf T} is ∣G∣|G| times the orthogonal projection onto a space VV of dimension bb: the vectors each of whose four segments is constant on the cosets of NN and has zero sum. The bb columns of DD must form an orthogonal basis of VV consisting of ±1\pm1 vectors, and so must the bb rows of EE. The corner is then forced, C=−EKTD/(4∣G∣)C=-EK^{\mathsf T}D/(4|G|), and it satisfies CCT=bICC^{\mathsf T}=bI automatically. Once such DD and EE are chosen, the one requirement that can fail is that the entries of CC be ±1\pm1.

Whether a core can be so bordered depends only on its sums over the cosets of NN, which are 4q4q integers; so bordering is a finite problem on the small group QQ, separate from the search for the core. For quotient groups of order 4, 6 and 8 it always can, after at most translating, inverting, negating or permuting the blocks of the core; we verified this by computer (Proposition 8). These are the widths b=12,20,28b=12,20,28. The case q=2q=2, width 4, is classical. Throughout, a width-bb matrix is a Hadamard matrix assembled from a core and a border of width bb, and a width-bb core is a core for such a border; the width is that of the border, not of the matrix or the core. This follows the usage of [23], whose bb is also the border width; in the phrase two circulant cores of [8, 40] each block is a core, whereas here the core is all four blocks together.

What is gained is freedom in the choice of GG. For v=479v=479, for example, v−1=2⋅239v-1=2\cdot239 admits no usable multiplier group, but v−3=476=22⋅7⋅17v-3=476=2^2\cdot7\cdot17, and G=Z22×Z119G=\mathbb{Z}_2^2\times\mathbb{Z}_{119} has a group of automorphisms of order 12 and quotients of orders 68 and 28 through which the search can be organised (§ 5.5). For order 668 we give both a width-4 and a width-12 matrix: the second search was far smaller than the first (Table 1). It was small because it looked only for cores with three fibres of a mixed type (§ 5.6), the fewest possible (Lemma 10); with so few, the core condition splits into four nearly independent systems.

Which order uses which method

In every search we fix a cell: the group GG, a group MM of its automorphisms (the multiplier group) under which every block is required to be invariant, and, for a bordered array (§ 3.2), a subgroup N≤GN \le G. A block is then one sign per MM-orbit, and (2), or for bordered arrays its analogue (3) or (4), is one quadratic equation per orbit of ⟨M,−1⟩\langle M,-1\rangle on the non-zero elements of GG. The columns signs and eqs of Table 1 count the signs of all four blocks and the equations. For example, the row of order 1916 describes the cell with G=Z2×Z119G = \mathbb{Z}_2 \times\mathbb{Z}_{119}, a multiplier group of order 12 and N=Z119N = \mathbb{Z}_{119}, which has 184 signs and 29 equations.

The row-sum condition of §1.2 can be met for v=223,283,311,487,491v = 223, 283, 311, 487, 491, with some odd t>1t > 1 dividing v−1v - 1, and for none of the other seven primes. For v=167,179,347,359,479v = 167, 179, 347, 359, 479, v−1v - 1 is twice a prime and the only odd t>1t > 1 is (v−1)/2(v - 1)/2. For this tt the possible row sums are ±1\pm1, ±(v−2)\pm(v - 2) and ±v\pm v, and no four of their squares sum to 4v4v. For v=419,443v = 419, 443 there are proper odd divisors but no suitable row sums. A bordered cell is most readily searched by compression (§ 4.2) when ∣G∣=v−(q−1)|G| = v - (q - 1) has several small factors, giving GG small quotients and automorphisms of small order fixing NN. At width 4 this is so for v=419,443v = 419, 443, where ∣G∣=2⋅11⋅19|G| = 2 \cdot11 \cdot19, 2⋅13⋅172 \cdot13 \cdot17. For v=167,179v = 167, 179 the group Z2×Zw\mathbb{Z}_2 \times\mathbb{Z}_w, w=(v−1)/2w = (v - 1)/2, has order twice a prime, and we searched it with no symmetry. For v=347,359,479v = 347, 359, 479 it would again have order twice a prime, and we used width 20 for 347, width 28 for 359 and width 12 for 479, where ∣G∣|G| has several small factors (Table 1).

References

  1. [1]L. Alpöge, P. Voinov and S. Reynolds-Haertle, Hadamard matrices of orders 668, 716, 892, 1132, 1244, 1388, 1436, 1676, 1772, 1916, 1948 and 1964, announcement with data, 12 August 2026; see https://epoch.ai/frontiermath/open-problems/hadamard.
  2. [2]L. D. Baumert and D. M. Gordon, On the existence of cyclic difference sets with small parameters, in: High Primes and Misdemeanours: Lectures in Honour of the 60th Birthday of Hugh Cowie Williams, Fields Inst. Commun. 41, Amer. Math. Soc., 2004, 61–68; arXiv:math/0304502.DOI
  3. [3]J. Bernasconi, Low autocorrelation binary sequences: statistical mechanics and configuration space analysis, J. Physique 48 (1987) 559–567.DOI
  4. [4]D. Best, D. Ž. Đoković, H. Kharaghani and H. Ramp, Turyn-type sequences: classification, enumeration, and construction, J. Combin. Des. 21 (2013) 24–35.
  5. [5]T. Beth, D. Jungnickel and H. Lenz, Design Theory, Vol. I, 2nd ed., Encyclopædia Math. Appl. 69, Cambridge University Press, 1999.
  6. [6]C. Bringas, I. S. Kotsireas and V. Ganesh, Applying computer algebra systems with SAT solvers to the Williamson conjecture, J. Symbolic Comput. 100 (2020) 187–209.
  7. [7]M. Cati and D. V. Pasechnik, A database of constructions of Hadamard matrices, arXiv:2411.18897v2, 2025.arxiv.org/abs/2411.18897
  8. [8]M. Chiandrini, I. S. Kotsireas, C. Koukouvinos and L. Paquete, Heuristic algorithms for Hadamard matrices with two circulant cores, Theoret. Comput. Sci. 407 (2008) 274–277.
  9. [9]T. Cooley, Hadamard matrices from Claude Code searches, GitHub repository, https://github.com/Middletownbooks/Hadamard, 2026.
  10. [10]J. Cooper, J. Milas and W. D. Wallis, Hadamard equivalence, in: Combinatorial Mathematics (Canberra 1977), Lecture Notes in Math. 686, Springer, 1978, 126–135.DOI
  11. [11]J. Cooper and J. Wallis, A construction for Hadamard arrays, Bull. Austral. Math. Soc. 7 (1972) 269–277.DOI
  12. [12]R. Craigen and H. Kharaghani, Hadamard matrices and Hadamard designs, in: Handbook of Combinatorial Designs, Chapman & Hall/CRC, 2007, 273–280.DOI
  13. [13]W. de Launey and D. L. Flannery, Algebraic Design Theory, Math. Surveys Monogr. 175, Amer. Math. Soc., 2011.
  14. [14]D. Ž. Đoković, Construction of some new Hadamard matrices, Bull. Austral. Math. Soc. 45 (1992) 327–332.DOI
  15. [15]D. Ž. Đoković, Williamson matrices of order 4n = 33, 35, 39, Discrete Math. 115 (1993) 267–271.DOI
  16. [16]D. Ž. Đoković, Two Hadamard matrices of order 956 of Goethals–Seidel type, Combinatorica 14 (1994) 375–377.DOI
  17. [17]D. Ž. Đoković, Hadamard matrices of order 764 exist, Combinatorica 28 (2008) 487–489.arxiv.org/abs/math/0703312
  18. [18]D. Ž. Đoković, Supplementary difference sets with symmetry for Hadamard matrices, Oper. Matrices 3 (2009) 557–569.arxiv.org/abs/0903.5053
  19. [19]D. Ž. Đoković, Two classes of Hadamard matrices of Goethals–Seidel type, arXiv:2404.14375v3, 2024.arxiv.org/abs/2404.14375
  20. [20]D. Ž. Đoković, O. Golubitsky and I. S. Kotsireas, Some new orders of Hadamard and skew-Hadamard matrices, J. Combin. Des. 22 (2014) 270–277.DOI
  21. [21]D. Ž. Đoković and I. S. Kotsireas, Compression of periodic complementary sequences and applications, Des. Codes Cryptogr. 74 (2015) 365–377.
  22. [22]D. Ž. Đoković and I. S. Kotsireas, Computational methods for difference families in finite abelian groups, Spec. Matrices 7 (2019) 127–141.DOI
  23. [23]R. Egan, I. S. Kotsireas, S. London and P. Ó Catháin, Recent progress in the construction of Hadamard matrices, arXiv:2610.27175v1, 2026.arxiv.org/abs/2610.27175
  24. [24]S. Eliahou, A 64-modular Hadamard matrix of order 668, Australas. J. Comb. 93(2) (2025) 422–427.
  25. [25]J. E. H. Elliott and A. T. Butson, Relative difference sets, Illinois J. Math. 10 (1966) 517–531.DOI
  26. [26]R. J. Fletcher, M. Gysin and J. Seberry, Application of the discrete Fourier transform to the search for generalised Legendre pairs and Hadamard matrices, Australas. J. Combin. 23 (2001) 75–86.
  27. [27]D. Gale, A theorem on flows in networks, Pacific J. Math. 7 (1957) 1073–1082.
  28. [28]A. V. Geramita and J. Seberry, Orthogonal Designs: Quadratic Forms and Hadamard Matrices, Marcel Dekker, New York, 1979.
  29. [29]J. M. Goethals and J. J. Seidel, A skew Hadamard matrix of order 36, J. Austral. Math. Soc. 11 (1970) 343–344.
  30. [30]M. Gysin and J. Seberry, An experimental search and new combinatorial designs via a generalisation of cyclotomy, J. Combin. Math. Combin. Comput. 27 (1998) 143–160.
  31. [31]J. Hadamard, Résolution d’une question relative aux déterminants, Bull. Sci. Math. 17 (1893) 240–246.DOI
  32. [32]W. H. Holzmann, H. Kharaghani and B. Tayfeh-Rezaie, Williamson matrices up to order 59, Des. Codes Cryptogr. 46 (2008) 343–352.DOI
  33. [33]K. J. Horadam, Hadamard Matrices and Their Applications, Princeton University Press, 2007.
  34. [34]D. C. Hunt and J. Wallis, Cyclotomy, Hadamard arrays and supplementary difference sets, Congr. Numer. 7 (1973) 351–381.
  35. [35]J. D. Jones, Hadamard-T: T-matrix witnesses and the Hadamard orders they close, GitHub repository, https://github.com/JD-Jones-ASES/Hadamard-T, version 0.1.0, 29 August 2026.
  36. [36]H. Kharaghani and B. Tayfeh-Rezaie, A Hadamard matrix of order 428, J. Combin. Des. 13 (2005) 435–440.DOI
  37. [37]I. S. Kotsireas, Structured Hadamard conjecture, in: Number Theory and Related Fields: In Memory of Alf van der Poorten, Springer Proc. Math. Stat. 43, Springer, 2013, 215–227.DOI
  38. [38]I. S. Kotsireas, R. Gallardo-Cava, A. I. Gómez and D. Gómez-Pérez, On the search of binary Legendre pairs of length pq², J. Symbolic Comput. 138 (2027) 102606.DOI
  39. [39]I. S. Kotsireas, C. Koukouvinos, P. M. Pardalos and O. V. Shylo, Periodic complementary binary sequences and combinatorial optimization algorithms, J. Comb. Optim. 20 (2010) 63–75.
  40. [40]I. S. Kotsireas, C. Koukouvinos and J. Seberry, Hadamard ideals and Hadamard matrices with two circulant cores, European J. Combin. 27 (2006) 658–668.
  41. [41]I. S. Kotsireas, C. Koukouvinos and J. Seberry, Weighing matrices and string sorting, Ann. Comb. 13 (2009) 305–313.DOI
  42. [42]I. S. Kotsireas and C. Koutschan, Legendre pairs of lengths ℓ ≡ 0 (mod 3), J. Combin. Des. 29 (2021) 870–887.DOI
  43. [43]I. S. Kotsireas, C. Koutschan, D. A. Bulutoglu, D. M. Arquette, J. S. Turner and K. J. Ryan, Legendre pairs of lengths ℓ ≡ 0 (mod 5), Spec. Matrices 11 (2023) 20230105.DOI
  44. [44]I. S. Kotsireas, C. Koutschan and A. Winterhof, Quaternary Legendre pairs II, Discrete Math. 348 (2025), no. 9, 114501.DOI
  45. [45]K. Kumar, New Hadamard matrices, GitHub repository, https://github.com/vatskishan03/Hadamard, version 2.1.0, 29 October 2026.
  46. [46]E. S. Lander, Symmetric Designs: An Algebraic Approach, London Math. Soc. Lecture Note Ser. 74, Cambridge University Press, 1983.
  47. [47]K. H. Leung and K. Momihara, New constructions of Hadamard matrices, J. Combin. Theory Ser. A 171 (2020) 105160.arxiv.org/abs/1809.05253
  48. [48]K. H. Leung, K. Momihara and Q. Xiang, A new family of Hadamard matrices of order 4(2q² + 1), Discrete Math. 344 (2021) 112163.
  49. [49]S. London, Constructing New Turyn Type Sequences, T-Sequences and Hadamard Matrices, PhD thesis, University of Illinois at Chicago, 2013.
  50. [50]S. London and I. S. Kotsireas, New Turyn-type sequences, Cryptogr. Commun. 17 (2025) 1601–1610.DOI
  51. [51]L. Lou, M. Xia and T. Xia, On T-matrices of order 6m + 1, Adv. Appl. Discrete Math. 21 (2019), no. 2, 163–181.DOI
  52. [52]T. Lumsden, I. S. Kotsireas and C. Bright, New results on periodic Golay pairs, Math. Comp. 95 (2026) 1517–1539.DOI
  53. [53]A. I. Medianik, Regular simplex inscribed into a cube and Hadamard matrix of half-circulant type, Mat. Fiz. Anal. Geom. 4 (1997) 458–471 (in Russian).
  54. [54]A. I. Medianik, Regular simplex inscribed into a cube, half-circulant Hadamard matrices and Gaussian sums, Mat. Fiz. Anal. Geom. 8 (2001) 58–81 (in Russian).
  55. [55]S. Mertens and C. Benassit, On the ground states of the Bernasconi model, J. Phys. A 31 (1998) 3731–3749.
  56. [56]M. Miyamoto, A construction of Hadamard matrices, J. Combin. Theory Ser. A 57 (1991) 86–108.DOI
  57. [57]K. Momihara and M. Yamada, Divisible difference families from Galois rings GR(4,n) and Hadamard matrices, Des. Codes Cryptogr. 73 (2014) 897–909.
  58. [58]OEIS Foundation Inc., Number of Hadamard matrices of order 4n (whose notes record the orders for which none is known), Entry A007299 in The On-Line Encyclopedia of Integer Sequences, https://oeis.org/A007299, accessed 2026.
  59. [59]R. E. A. C. Paley, On orthogonal matrices, J. Math. Phys. 12 (1933) 311–320.DOI
  60. [60]A. F. Ramos, D. B. Hulak and R. J. G. B. de Queiroz, Multiplier obstructions for Legendre pairs of length 333, J. Combin. Des., published online 28 October 2026, doi:10.1002/jcd.70044; arXiv:2607.20675v2.
  61. [61]H. J. Ryser, Combinatorial properties of matrices of zeros and ones, Canad. J. Math. 9 (1957) 371–377.
  62. [62]L. Schneider, hadamard-2060, GitHub repository, https://github.com/schneiderlo/hadamard-2060, 2026.
  63. [63]A. Schumer, Periodic T-matrices of order 151 and a skew spin Goethals–Seidel family over Z/917: certificates and Hadamard constructions of orders 3676, 5436, 6644 and 7852, Zenodo, https://doi.org/10.5281/zenodo.22820997, version 1.0.0, 17 September 2026.
  64. [64]J. Seberry and M. Yamada, On the products of Hadamard matrices, Williamson matrices and other orthogonal matrices using M-structures, J. Combin. Math. Combin. Comput. 7 (1990) 97–137.
  65. [65]J. Seberry and M. Yamada, Hadamard matrices, sequences, and block designs, in: Contemporary Design Theory: A Collection of Surveys, Wiley, 1992, 431–560.
  66. [66]J. Seberry and M. Yamada, On the multiplication theorems of Hadamard matrices of generalized quaternion type using M-structures, J. Combin. Math. Combin. Comput. 13 (1993) 97–106.
  67. [67]J. Seberry and M. Yamada, Hadamard Matrices: Constructions using Number Theory and Algebra, Wiley, 2020.DOI
  68. [68]E. Spence, Hadamard matrices from relative difference sets, J. Combin. Theory Ser. A 19 (1975) 287–300.DOI
  69. [69]A. B. Suksmono and Y. Minato, Quantum computing formulation of some classical Hadamard matrix searching methods and its implementation on a quantum computer, Sci. Rep. 12 (2022), doi:10.1038/s41598-021-03586-0.DOI
  70. [70]G. Szekeres, Tournaments and Hadamard matrices, Enseign. Math. 15 (1969) 269–278.DOI
  71. [71]G. Szekeres, A skew Hadamard matrix of order 52, Canad. J. Math. 21 (1969) 1319–1322.DOI
  72. [72]J. S. Turner, I. S. Kotsireas, D. A. Bulutoglu and A. J. Geyer, A Legendre pair of length 77 using complementary binary matrices with fixed marginals, Des. Codes Cryptogr. 89 (2021) 1321–1333.arxiv.org/abs/2101.10918
  73. [73]R. J. Turyn, Character sums and difference sets, Pacific J. Math. 15 (1965) 319–346.DOI
  74. [74]R. J. Turyn, An infinite class of Williamson matrices, J. Combin. Theory Ser. A 12 (1972) 319–321.DOI
  75. [75]R. J. Turyn, Hadamard matrices, Baumert–Hall units, four-symbol sequences, pulse compression, and surface wave encodings, J. Combin. Theory Ser. A 16 (1974) 313–333.DOI
  76. [76]J. Wallis and A. L. Whiteman, Some classes of Hadamard matrices with constant diagonal, Bull. Austral. Math. Soc. 7 (1972) 233–249.DOI
  77. [77]W. D. Wallis, A. P. Street and J. S. Wallis, Combinatorics: Room Squares, Sum-Free Sets, Hadamard Matrices, Lecture Notes in Math. 292, Springer, 1972.DOI
  78. [78]A. L. Whiteman, Hadamard matrices of order 4(2p + 1), J. Number Theory 8 (1976) 1–11.DOI
  79. [79]G. Williamson, O. Yacobi and P. Zinn-Justin, Generating Hadamard matrices with transformers, arXiv:2604.11101v2, 2026.arxiv.org/abs/2604.11101
  80. [80]J. Williamson, Hadamard’s determinant theorem and the sum of four squares, Duke Math. J. 11 (1944) 65–81.DOI
  81. [81]M. Xia, T. Xia, J. Seberry and H. Qin, Construction of T-matrices of order 6m + 1, Far East J. Math. Sci. 101 (2017), no. 8, 1731–1749.DOI
  82. [82]M. Yamada, Some new series of Hadamard matrices, J. Austral. Math. Soc. Ser. A 46 (1989) 371–383.
  83. [83]Supplementary data for this paper (sequences, blocks, frames, matrices and scripts). Not publicly deposited.

Paper details

vlnc:W_w84umanw
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC0-1.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Anthropic Claude Opus 5.5, Anthropic Claude Fable 5.1, Anthropic Claude Fable 5.2

View statement
Looking for related papers…
Contents