A Search for Hadamard Matrices constructed from Williamson Matrices

Horton, J; Koukouvinos, C; Seberry, J

dc.contributor.author	Horton, J	en
dc.contributor.author	Koukouvinos, C	en
dc.contributor.author	Seberry, J	en
dc.date.accessioned	2014-03-01T01:51:27Z
dc.date.available	2014-03-01T01:51:27Z
dc.date.issued	2002	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/26297
dc.subject	Distributed Computing	en
dc.subject	hadamard matrices	en
dc.title	A Search for Hadamard Matrices constructed from Williamson Matrices	en
heal.type	journalArticle	en
heal.publicationDate	2002	en
heal.abstract	We describe the implementation of a distributed computer search that uses Williamson's construction for Hadamard ma trices. The search program is used to perform a complete search for matrices of orders 100 through 148. No new results are found, confirming existin g results. We are convinced that no further matrices of any order less than 156 may be constructed. For	en