Answers are grounded in this paper and cite their sources.
In this work we revisited some properties of Sylvester Hadamard matrices of order 2k. Based onlyon the existence of a base from which any Sylvester Hadamard matrix can be constructed, we prove that theirrows (columns) are closed under addition and that the numbers of sign interchanges along any row (column)give all integers 0, 1, . . . , 2k − 1 in some order. These two properties can be used to check if an Hadamardmatrix is equivalent to a Sylvester Hadamard matrix.
No takes yet. Share an insight, caveat, or question.
Marilena Mitrouli (2014) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: