Skip to main content
placeholder image

Inner product vectors for Skew-Hadamard matrices

Conference Paper


Abstract


  • 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.

Publication Date


  • 2015

Citation


  • Kotsireas, I. S., Seberry, J., & Suharini, Y. S. (2015). Inner product vectors for Skew-Hadamard matrices. In Springer Proceedings in Mathematics and Statistics Vol. 133 (pp. 171-187). doi:10.1007/978-3-319-17729-8_14

Scopus Eid


  • 2-s2.0-84945973680

Web Of Science Accession Number


Start Page


  • 171

End Page


  • 187

Volume


  • 133

Abstract


  • 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.

Publication Date


  • 2015

Citation


  • Kotsireas, I. S., Seberry, J., & Suharini, Y. S. (2015). Inner product vectors for Skew-Hadamard matrices. In Springer Proceedings in Mathematics and Statistics Vol. 133 (pp. 171-187). doi:10.1007/978-3-319-17729-8_14

Scopus Eid


  • 2-s2.0-84945973680

Web Of Science Accession Number


Start Page


  • 171

End Page


  • 187

Volume


  • 133