Quaternionic Perfect Sequences and Hadamard Matrices
Aidan Bennett, Curtis Bright, Paul Colinot, Ashwin Nayak

TL;DR
This paper explores quaternionic perfect sequences and their connection to Hadamard matrices, providing a faster enumeration algorithm, new classifications, and insights into their properties relevant for quantum communication.
Contribution
It introduces a novel enumeration algorithm for quaternion-type Hadamard matrices, proves structural properties, and constructs new matrices with applications in quantum communication.
Findings
Enumeration of matrices up to order 21, surpassing previous limits
Blocks in quaternion-type Hadamard matrices are necessarily amicable
Constructed quaternionic Hadamard matrices are not equivalent to known types
Abstract
A finite sequence of numbers is perfect if it has zero periodic autocorrelation after a nontrivial cyclic shift. In this work, we study quaternionic perfect sequences having a one-to-one correspondence with the binary sequences arising in Williamson's construction of quaternion-type Hadamard matrices. Using this correspondence, we devise an enumeration algorithm that is significantly faster than previously used algorithms and does not require the sequences to be symmetric. We implement our algorithm and use it to enumerate all circulant and possibly non-symmetric Williamson-type matrices of orders up to 21; previously, the largest order exhaustively enumerated was 13. We prove that when the blocks of a quaternion-type Hadamard matrix are circulant, the blocks are necessarily pairwise amicable. This dramatically improves the filtering power of our algorithm: in order 20, the number of…
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 · Coding theory and cryptography · Wireless Communication Networks Research
