Abstract
There are various constructions for Hadamard matrices - Kronecker product, Paley type I and II, Williamson type etc. In this paper we will investigate those of Williamson type, and suggest a search algorithm for Hadamard matrices of Williamson type. Using this we had searched the Hadamard matrices of order 92. It took about 6.8 hours in DEC alpha PC. Based on the data for the order 92, we give an estimate for the exhaustive computer search for Hadamard matrices of Williamson type of order 428.
| Original language | English |
|---|---|
| Pages | 117-120 |
| Number of pages | 4 |
| Publication status | Published - 1998 |
| Event | Proceedings of the 1998 4th International Conference on Signal Processing Proceedings, ICSP '98 - Beijing, China Duration: 1998 Oct 12 → 1998 Oct 16 |
Other
| Other | Proceedings of the 1998 4th International Conference on Signal Processing Proceedings, ICSP '98 |
|---|---|
| City | Beijing, China |
| Period | 98/10/12 → 98/10/16 |
All Science Journal Classification (ASJC) codes
- Software
- Signal Processing
- Computer Science Applications