Corpus ID: 35917305

Application of the discrete Fourier transform to the search for generalised Legendre pairs and Hadamard matrices

@article{Fletcher2001ApplicationOT,
  title={Application of the discrete Fourier transform to the search for generalised Legendre pairs and Hadamard matrices},
  author={Roderick J. Fletcher and Marc Gysin and J. Seberry},
  journal={Australas. J Comb.},
  year={2001},
  volume={23},
  pages={75-86}
}
We introduce Legendre sequences and generalised Legendre pairs (G L­ pairs). We show how to construct an Hadamard matrix of order 2£ + 2 from a GL-pair of length f. We review the known constructions for GL­ pairs and use the discrete Fourier transform (DFT) and power spectral density (PSD) to enable an exhaustive search for GL-pairs for lengths f ::::; 47 and partial searches for other f, 
Conference matrices from Legendre C-pairs
A Legendre pair of length 77 using complementary binary matrices with fixed marginals
Hadamard ideals and Hadamard matrices with two circulant cores
Computation of Maximal Determinants of Binary Circulant Matrices
Heuristic algorithms for Hadamard matrices with two circulant cores
Switching Operations for Hadamard Matrices
  • W. Orrick
  • Mathematics, Computer Science
  • SIAM J. Discret. Math.
  • 2008
...
1
2
3
4
5
...