2 papers
cs.SC2019
Complex Golay Pairs up to Length 28: A Search via Computer Algebra and Programmatic SAT
Curtis Bright, Ilias Kotsireas, Albert Heinle +1
We use techniques from the fields of computer algebra and satisfiability checking to develop a new algorithm to search for complex Golay pairs. We implement this algorithm and use…
cs.LO2018
Enumeration of Complex Golay Pairs via Programmatic SAT
Curtis Bright, Ilias Kotsireas, Albert Heinle +1
We provide a complete enumeration of all complex Golay pairs of length up to 25, verifying that complex Golay pairs do not exist in lengths 23 and 25 but do exist in length 24. Thi…