Search of Hadamard Matrices by Turyn Sequences
保存先:
| 著者: | |
|---|---|
| フォーマット: | artículo original |
| 状態: | Versión publicada |
| 出版日付: | 2011 |
| その他の書誌記述: | In this paper we study the Hadamard matrices and some algorithms to generate them. We review some theoretical aspects about Hadamard's conjecture, which asserts that every positive integer multiple of 4 is a Hadamard number. Then we describe the methods of Kronecker, Sylvester, Paley, Williamson, Goethals-Seidel, Cooper- Wallis, Baumert-Hall, Ehlich and supplementary dierence sets. Subsequently we settle the Hadamard sieve: 668 is lowest order for which is unknown if there exist an Hadamard matrix. Finally we propose a simulated annealing algorithms as alternative to nd Hadamard matrices from Turyn sequences. We found excellent solutions with this search method. |
| 国: | Portal de Revistas UCR |
| 機関: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| 言語: | Español |
| OAI Identifier: | oai:archivo.portal.ucr.ac.cr:article/2094 |
| オンライン･アクセス: | https://archivo.revistas.ucr.ac.cr/index.php/matematica/article/view/2094 |
| キーワード: | Hadamard matrices simulated annealing combinatorial optimization matrices de Hadamard recocido simulado optimización combinatoria |