Hadamard Matrices and Their Applications
A. S. Hedayat,W. D. Wallis +1 more
TLDR
Hadamard matrices have been widely studied in the literature and many of their applications can be found in this paper, e.g., incomplete block designs, Youden designs, orthogonal $F$-square designs, optimal saturated resolution III (SRSIII), optimal weighing designs, maximal sets of pairwise independent random variables with uniform measure, error correcting and detecting codes, Walsh functions, and other mathematical and statistical objects.Abstract:
An $n \times n$ matrix $H$ with all its entries $+1$ and $-1$ is Hadamard if $HH' = nI$. It is well known that $n$ must be 1, 2 or a multiple of 4 for such a matrix to exist, but is not known whether Hadamard matrices exist for every $n$ which is a multiple of 4. The smallest order for which a Hadamard matrix has not been constructed is (as of 1977) 268. Research in the area of Hadamard matrices and their applications has steadily and rapidly grown, especially during the last three decades. These matrices can be transformed to produce incomplete block designs, $t$-designs, Youden designs, orthogonal $F$-square designs, optimal saturated resolution III designs, optimal weighing designs, maximal sets of pairwise independent random variables with uniform measure, error correcting and detecting codes, Walsh functions, and other mathematical and statistical objects. In this paper we survey the existence of Hadamard matrices and many of their applications.read more
Citations
More filters
Posted Content
Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds
Shuyang Ling,Thomas Strohmer +1 more
TL;DR: In this paper, it was shown that under reasonable and practical assumptions, it is possible to recover the transmitted functions and the impulse responses in a robust, reliable, and efficient manner from just one single received function by solving a semidefinite program.
Proceedings ArticleDOI
The SPRIGHT algorithm for robust sparse Hadamard Transforms
TL;DR: It is shown that the K-sparse HT of the signal can be reconstructed from noisy time domain samples with a vanishing error probability using the same sample complexity O(K logN) as in the noiseless case of [1] and computational complexity1 O(N logN).
Journal ArticleDOI
Robustness of A-optimal designs☆
Joe Masaro,Chi Song Wong +1 more
TL;DR: In this paper, the covariance of a normal random vector with mean Xb and covariance σ 2 I n is ρ with ρ ≠ 0, where ρ is the sign of ρ.
Journal ArticleDOI
Hadamard matrices of the Williamson type of order 4·Cm, m = p ·Cq an exhaustive search for m =33
TL;DR: It is established that there are four non-equivalent Hadamard matrices of the Williamson type of order 4·33, and an algorithm is given reducing considerably the required computational time and suitable when m is not a prime.