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
Journal ArticleDOI
A-optimal design matrices X=(xij )N×n with xij =−1,0,1 ∗
Chi Song Wong,Joseph C. Masaro +1 more
TL;DR: In this paper, a -optimal design in K(n,n) is given for n < 6 and for n = 6 for n ≥ 1.0. But small n and n are more important for practical use.
Proceedings ArticleDOI
Light sensor calibration and dimming sequence design in distributed lighting control systems
TL;DR: The proposed methods improve the illumination performance of the lighting system in event of reflectance changes and an associated lighting control algorithm is shown to be effective.
Journal ArticleDOI
Some families of group divisible designs
Sanpei Kageyama,Tatsuzo Tanaka +1 more
TL;DR: In this paper, some new families of semi-regular or regular group divisible designs are presented, together with new nonisomorphic solutions for some known group-divisible designs.
Journal ArticleDOI
Construction of orthogonal two-level designs of user-specified resolution where N≠2 k
TL;DR: In this paper, an algorithm for constructing orthogonal parallel-flats designs to meet user specifications is presented. But the run sizes in this class of designs do not necessarily need to be powers of 2.
Posted Content
Paley and the Paley graphs
TL;DR: In this article, the authors discuss some aspects of the history of the Paley graphs and their automorphism groups, and discuss automorphisms in the context of Paley automata.