Algorithms to find new orders of skew-Hadamard matrices by complete searches are not efficient and require extensive CPU time. We consider a method relying on pre-calculation of inner product vectors aiming to reduce the search space. We apply our method to the algorithm of Seberry-Williamson to construct skew-Hadamard matrices. We find all possible solutions for ≤ 29. We use these results to improve analysis in order to reduce the search space.
CITATION STYLE
Kotsireas, I. S., Seberry, J., & Suharini, Y. S. (2015). Inner product vectors for skew-hadamard matrices. In Algebraic Design Theory and Hadamard Matrices: ADTHM, Lethbridge, Alberta, Canada, July 2014 (Vol. 133, pp. 171–187). Springer International Publishing. https://doi.org/10.1007/978-3-319-17729-8_14
Mendeley helps you to discover research relevant for your work.