Enumeration of complex Golay pairs

These files contain an enumeration of complex Golay pairs of lengths up to 28.  The method of generation is described in the paper "Enumeration of Complex Golay Pairs via Programmatic SAT" by Bright, Kotsireas, Heinle, and Ganesh, presented at ISSAC 2018, the International Symposium on Symbolic and Algebraic Computation.

The .all files contain every complex Golay pair in the given length, the .seqs files contain all individual sequences which occur in those pairs, and the .inequiv files contain only the complex Golay pairs up to an equivalence which is given in the above paper.  Every line in each file contains exactly one complex Golay pair or sequence, with spaces separating the members of the pairs. The sequence entries are encoded using the characters + for 1, - for −1, i for i, and j for −i.

A table with the sequence counts in each file is also available.