Results 211 to 220 of about 562,872 (260)
Some of the next articles are maybe not open access.
Embedding matrices in Hadamard matrices
Linear and Multilinear Algebra, 1986It is shown that if A is any n×n matrix of zeros and ones, and if k is the smallest number not less than n which is the order of an Hadamard matrix, then A is a submatrix of an Hadamard matrix of order k2 .
openaire +1 more source
Deciding Hadamard equivalence of Hadamard matrices
BIT, 1981Equivalence of Hadamard matrices can be decided inO(log2n) space, and hence in subexponential time. These resource bounds follow from the existence of small distinguishing sets.
Colbourn, Charles J. +1 more
openaire +2 more sources
Trades in complex Hadamard matrices
, 2015A trade in a complex Hadamard matrix is a set of entries which can be changed to obtain a different complex Hadamard matrix. We show that in a real Hadamard matrix of order n all trades contain at least n entries.
Padraig 'O Cath'ain, Ian M. Wanless
semanticscholar +1 more source
Statistics & Probability Letters, 1988
A method for the construction of \(v\times b\) matrices with elements 1, - 1, such that \(XX'=bI\), is given.
openaire +1 more source
A method for the construction of \(v\times b\) matrices with elements 1, - 1, such that \(XX'=bI\), is given.
openaire +1 more source
Journal of Combinatorial Designs, 2012
AbstractTwo Hadamard matrices are considered equivalent if one is obtained from the other by a sequence of operations involving row or column permutations or negations. We complete the classification of Hadamard matrices of order 32. It turns out that there are exactly 13,710,027 such matrices up to equivalence.
Kharaghani, Hadi, Tayfeh-Rezaie, Behruz
openaire +2 more sources
AbstractTwo Hadamard matrices are considered equivalent if one is obtained from the other by a sequence of operations involving row or column permutations or negations. We complete the classification of Hadamard matrices of order 32. It turns out that there are exactly 13,710,027 such matrices up to equivalence.
Kharaghani, Hadi, Tayfeh-Rezaie, Behruz
openaire +2 more sources
Jacket matrices constructed from Hadamard matrices and generalized Hadamard matrices
2006Let \(H\) be a matrix. We define \(H^\dagger\) to be the Hermitian conjugate of \(H\), i.e. the transpose of the matrix which elements are the complex conjugates of the corresponding elements of \(H\). When the entries of \(H\) form a group \(G\), then we define \(H^M\) to be the transpose of the matrix which elements are the group inverse of the ...
Finlayson, Ken +3 more
openaire +1 more source
Generalised Hadamard matrices and translations
Journal of Statistical Planning and Inference, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
McDonough, T. P. +2 more
openaire +2 more sources
Submitted in complete fulfilment of the requirements for the degree of Master of Science in the Department of Mathematics, School of Physical Sciences, La Trobe University, Victoria, Australia.
openaire +1 more source
openaire +1 more source
Linear and Multilinear Algebra, 1973
R. J. Turyn introduced complex Hadamard matrices and showed that if there is a complex Hadamard matrix of order c and a real Hadamard matrix of order h> > 1, then there is a real Hadamard matrix of order he. Previously, complex Hadamard matrices were only known for a few small orders and the orders for which symmetric conference matrices were known ...
openaire +1 more source
R. J. Turyn introduced complex Hadamard matrices and showed that if there is a complex Hadamard matrix of order c and a real Hadamard matrix of order h> > 1, then there is a real Hadamard matrix of order he. Previously, complex Hadamard matrices were only known for a few small orders and the orders for which symmetric conference matrices were known ...
openaire +1 more source
Integral equivalence of hadamard matrices
Israel Journal of Mathematics, 1971SupposeA is a non-singular matrix with entries 0 and 1, the zero and identity elements of a Euclidean domain. We obtain a “best-possible” lower bound for the number of equivalence invariants ofA (over the domain) which equal 1. From this it is proven that the sequence of invariants under integral equivalence of an Hadamard matrix must obey certain ...
openaire +1 more source

