Asymptotically optimal approximate Hadamard matrices
Boris Alexeev, John Jasper, Dustin G. Mixon

TL;DR
This paper investigates approximate Hadamard matrices, demonstrating that their condition number approaches 1 as size increases and providing explicit families of such matrices.
Contribution
It proves the asymptotic optimality of approximate Hadamard matrices and identifies explicit infinite families of these matrices.
Findings
Condition number approaches 1 as n increases
Explicit infinite families of approximate Hadamard matrices identified
Well-conditioned matrices with entries in {±1}
Abstract
In this paper, we study approximate Hadamard matrices, that is, well-conditioned matrices with all entries in . We show that the smallest-possible condition number goes to as , and we identify some explicit infinite families of approximate Hadamard matrices.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Approximation Theory and Sequence Spaces · Mathematical Inequalities and Applications
