The following files contain an enumeration of the complex Golay sequences of a given order n. The all files contain every complex Golay sequence of that order and the inequiv files only contain those which are pairwise inequivalent. The sequences are encoded using the characters + for 1, - for −1, i for i, and j for −i.
Source code for generating sequences which pass the filtering criterion.