scientific article; zbMATH DE number 2128113
An Hadamard matrix is a square matrix \(H\) of order \(n\) with \(n= 1,2\), or \(4t\) with all entries \(1\) or \(-1\) and which satisfies \(HH^T= nI_n\). These matrices are used extensively in coding and communications [\textit{J. Seberry} and \textit{M. Yamada}, Contemporary desing theory, Collect. Surv., 431--560 (1992; Zbl 0776.05028)]. In the present paper the authors survey a large number of algorithms for the construction of Hadamard matrices, and they begin Section 1 with results from the use of Williamson matricies [(*) \textit{J. Horton}, \textit{C. Koukouvinos} and \textit{J. Seberry}, Bull. Inst. Comb. Appl. 35, 75--88 (2002; Zbl 0990.05018)] of order \(n\) to get Hadamard matrices of order \(4n\). Then they describe over several subsections two recent intricate algorithms of this type of their own. They used a server which broke the work into smaller portions and at various times as many as 37 other computers. The first method of theirs used \(n\)th roots of unity of \(n\) and the second dealt with \(n = pq\) [\textit{C. Koukouvinos} and \textit{S. Kounias}, Discrete Math. 68, 45--57 (1988; Zbl 0667.05010)] and used circulant matrices. Results for orders \(n= 100\) to \(n= 180\) are included in [(*)]. Section 1 also contains methods of obtaining Hadamard matrices from generalized Legendre pairs using the discrete Fourier transform, from generalized Legendre pairs using supplementary difference sets, and from two circulant matrices. Section 2 deals with inequivalent Hadamard matrices which have been normalized. Since one can multiply a row or column of a Hadamard matrix without changing the the equation \(HH^T= nI_n\), one can normalize a Hadamard matrix so that its first row and column are all ones. Equivalency is a difficult computational problem even for normalized matrices. The results so far are: Hadamard matrices of orders less than 16 are unique up to equivalence (any sequence of row negations, row permutations, column negations, column permutations); there are five equivalence classes for \(n= 16\); three equivalence classes of order 20; sixty equivalence classes of order 24; there are 487 classes of order 28. The classification of orders \(n\) larger than 28 is still open (exhaustive search is an NP hard problem). Section 3 deals with algorithms for constructing orthogonal designs and is partly based on [\textit{A. V. Geramita} and \textit{J. Seberry}, Orthogonal designs. Quadratic forms and Hadamard matrices (Lecture Notes in Pure and Applied Mathematics 45, New York, Basel: Marcel Dekker) (1979; Zbl 0411.05023)] but contains insightful summaries of recent work. Section 4 deals with short amicable sets and Kharaghani type orthogonal designs and is quite recent, based on results in [\textit{S. Georgiou}, \textit{C. Koukouvinos} and \textit{J. Seberry}, Int. J. Appl. Math. 9, No. 2, 161--187 (2002; Zbl 1024.05013)]. The authors have masterfully summarized a huge body of work for the interested reader (38 of the 90 citations are due to one or more of the co-authors). For the entire collection see [Zbl 1050.05003].
- scientific article; zbMATH DE number 5265621
- Hadamard matrices on error detection and correction: useful links to BIBD
- scientific article; zbMATH DE number 1751601
- scientific article; zbMATH DE number 4063098
- scientific article; zbMATH DE number 874523
- scientific article; zbMATH DE number 5036057
- Improving the lower bounds on inequivalent Hadamard matrices through orthogonal designs and meta-programming techniques
- scientific article; zbMATH DE number 4049663
- Hadamard matrices of order 32
- Genetic algorithms for orthogonal designs
- 2-(31,15,7), 2-(35,17,8) and 2-(36,15,6) designs with automorphisms of odd prime order, and their related Hadamard matrices and codes
- Hadamard 2-(63,31,15) designs invariant under the dihedral group of order 10
- On good matrices, skew Hadamard matrices and optimal designs
- A practical algorithm for completing half-Hadamard matrices using LLL
- Hadamard matrices, \(d\)-linearly independent sets and correlation-immune Boolean functions with minimum Hamming weights
- Geometric search for Hadamard matrices
- Hadamard ideals and Hadamard matrices with two circulant cores
- Orthogonal matrix and its application in Bloom's threshold scheme
- Inequivalent Hadamard matrices from near normal sequences
- A meta-software system for orthogonal designs and Hadamard matrices
- scientific article; zbMATH DE number 4075078 (Why is no real title available?)
- scientific article; zbMATH DE number 68338 (Why is no real title available?)
- scientific article; zbMATH DE number 177959 (Why is no real title available?)
- A sensitive algorithm for detecting the inequivalence of Hadamard matrices
- scientific article; zbMATH DE number 1751601 (Why is no real title available?)
- scientific article; zbMATH DE number 7008242 (Why is no real title available?)
- A Bird’s-Eye View of Modern Symmetric Cryptography from Combinatorial Designs
- A sign test for detecting the equivalence of Sylvester Hadamard matrices
- Inequivalent Hadamard matrices of order 2n constructed from Hadamard matrices of order n
- Hadamard ideals and Hadamard matrices from two circulant submatrices
- scientific article; zbMATH DE number 2197880 (Why is no real title available?)
- Genetic algorithms for orthogonal designs
- Orthogonal designs via computational algebra
- Independent component analysis for multiple-input multiple-output wireless communication systems
- Legendre G‐array pairs and the theoretical unification of several G‐array families
- Orthogonal arrays: a review
- On the growth factor of Hadamard matrices of order 20
- New two-variable full orthogonal designs and related experiments with linear regression models
- Heuristic algorithms for Hadamard matrices with two circulant cores
- Improving the lower bounds on inequivalent Hadamard matrices through orthogonal designs and meta-programming techniques
- Orthogonal Latin hypercube designs from generalized orthogonal designs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3155152)