A path to Hadamard Matrices

Embury, P and Rao, A 2007, 'A path to Hadamard Matrices', Lecture Notes in Computer Science, vol. 4851, pp. 281-290.


Document type: Journal Article
Collection: Journal Articles

Attached Files
Name Description MIMEType Size
n2006006652.pdf Accepted manuscript application/pdf 311.00KB
Title A path to Hadamard Matrices
Author(s) Embury, P
Rao, A
Year 2007
Journal name Lecture Notes in Computer Science
Volume number 4851
Start page 281
End page 290
Total pages 9
Publisher Springer
Abstract There are characteristics of Hadamard matrices that enable an exhaustive search using algorithmic techniques. The search derives primarily from the eigenvalues which are constant after the Hadamard matrix is multiplied by its transpose. Generally this would be a performance concern but there are additional properties that enable the eigenvalues to be predicted. Here an algorithm is given to obtain a Hadamard matrix from a matrix of 1s using optimisation techniques on a row-by-row basis.
Subject Mathematical Logic, Set Theory, Lattices and Universal Algebra
Keyword(s) Hadamard matrices
eigen values
optimization
DOI - identifier 10.1007/978-3-540-77224-8_33
Copyright notice © Springer-Verlag Berlin Heidelberg 2007
ISSN 0302-9743
Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 0 times in Scopus Article
Altmetric details:
Access Statistics: 308 Abstract Views, 515 File Downloads  -  Detailed Statistics
Created: Wed, 18 Feb 2009, 09:53:18 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us