Hadamard matrices and their applications

From MaRDI portal
Publication:5906160

DOI10.1214/aos/1176344370zbMath0401.62061OpenAlexW2034198076WikidataQ56288959 ScholiaQ56288959MaRDI QIDQ5906160

A. S. Hedayat, Walter D. Wallis

Publication date: 1978

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aos/1176344370




Related Items (95)

Eigenvalues of Circulant Matrices and a Conjecture of RyserCombining SAT solvers with computer algebra systems to verify combinatorial conjecturesOn the number of Hadamard matrices via anti-concentrationAn Oppenheim type inequality for positive definite block matricesThe fractal nature of folds and the Walsh copolymersOn the complexity of some basic problems in computational convexity. I. Containment problemsHadamard matrices of order 36 with automorphisms of order 17Neural network and regression spline value function approximations for stochastic dynamic programmingUnnamed ItemOn the equivalence of certain constant weight codes and combinatorial designsOn orthogonal arrays attaining Rao's boundsFinite Parseval frames in Walsh analysisSome resolvable orthogonal arrays with two symbolsThe problem of confounding in two-factor experimentsA Real eigenvector of Circulant matrices and a conjecture of RyserMarginal proportional frequency arrays of order 2Hadamard matrices of the Williamson type of order 4\(\cdot m\), \(m=p\cdot q\) an exhaustive search for \(m=33\)E-optimal 2ksaturated designsMixed difference matrices and the construction of orthogonal arraysD-optimal cyclic complex linear designs and supplementary difference sets with association vectorFixed-parameter tractability of crossover: steady-state GAs on the closest string problemStatistical Query Algorithms for Mean Vector Estimation and Stochastic Convex OptimizationLargest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problemEstimating correlation matrices that have common eigenvectors.Nonisomorphic complete sets of orthogonal f-squares and hadamard matricesCharacterizing projected designs: repeat and mirror-image runs\(D\)-optimal fractional factorial designsResolvable block designs in construction of approximate real MUBs that are sparseOn Hadamard embeddabiityDivisible difference families from Galois rings \(\mathrm{GR}(4,n)\) and Hadamard matricesUnnamed ItemA catalog of 2-level orthogonal minimally aliased designs with small runsFamilies of multi-level Legendre-like arraysQuantum memory receiver for superadditive communication using binary coherent statesQuadratic rotation symmetric Boolean functionsLinear Programming on the Stiefel ManifoldExistence of an A-optimal model for a regression experimentOn degree-\(d\) zero-sum sets of full rankA general approach to optimal control of a regression experimentConstruction of group divisible designs and rectangular designs from resolvable and almost resolvable balanced incomplete block designsPainless breakups -- efficient demixing of low rank matricesConnection between the Hadamard and matrix products with an application to matrix-variate Birnbaum-Saunders distributionsConstructions of Pairwise-and Variance-Balanced DesignsCyclic designs for a covariate modelOptimal designs for covariates modelsBinary Linear Codes with Near-Extremal Maximum DistanceSupersaturated design including an orthogonal baseSome D-optimal odd-equireplicated designs for a covariate modelPaley and the Paley GraphsRobustness of \(A\)-optimal designsRobustness of optimal designs for correlated random variablesUnnamed Item\(D\)-optimal designs for correlated random vectorsGlass phenomenology in the hard matrix modelA-optimal design matricesX=(xij)N×nwithxij=−1,0,1Test for high dimensional covariance matricesA weak difference set construction for higher dimensional designsTriangle- and pentagon-free distance-regular graphs with an eigenvalue multiplicity equal to the valencyRecent developments in nonregular fractional factorial designsA construction of D-optimal weighing designs when n\(\equiv 3\) mod 4Embedding cyclic Latin squares of order \(2^ n\) in a complete set of orthogonal F-squaresSome characterizations of affinely full-dimensional factorial designsRectangular Hadamard matricesThe maximum determinant of 21\(\times 21\) \((+1,-1)\)-matrices and D-optimal designsUnnamed ItemG-optimal N-observation first order \(2^ k\) designsSpectral analysis of phylogenetic dataFractional factorial designs of two and three levelsThe SAT+CAS method for combinatorial search with applications to best matricesError-correcting codes associated with complex Hadamard matricesPolynomial construction of complex Hadamard matrices with cyclic coreSerially balanced factorial sequencesMathCheck2: A SAT+CAS Verifier for Combinatorial ConjecturesHadamard design and artificial neural netsConstructing definitive screening designs using cyclic generatorsStructured Hadamard ConjectureSome families of group divisible designsThe family of t-designs. IIProperties of complete sets of mutually equiorthogonal frequency hypercubesConstruction of complete sets of mutually equiorthogonal frequency hypercubesOn the optimality of chemical balance weighing designsConjectures about Hadamard matricesThe exact D-optimal first order saturated design with 17 observationsA-optimal design matricesSome D-optimal weighing designs for n=3 (mod 4)Sir Thomas Muir, 1844--1934Hadamard matrices of order 28 with automorphisms of order 13Optimal Weighing DesignsVariations on seven points: An introduction to the scope and methods of coding theory and finite geometriesAnti-Hadamard matricesHadamard matrices of order 28 with automorphisms of order 7An infinite family of Hadamard matrices constructed from Paley type matricesStrongly threefold orthogonal matrices with statistical applicationsTwo-level Orthogonal and Saturated Designs for Estimating Main Effects and Certain Important InteractionsOn higher dimensional cocyclic Hadamard matrices




This page was built for publication: Hadamard matrices and their applications