A new search for skewsymmetric binary sequences with optimal merit factors
Marcel J. E. Golay, D. B. Harris · IEEE Transactions on Information Theory · 1990
Previous results on skewsymmetric sequences with low autocorrelation obtained by making exhaustive searches for sequences with optimal merit factor are extended up to length 69. A sieve that required both the symmetric and antisymmetric components of a skewsymmetric sequence to have high merit factor to make limited searches up to length 117 was used, and many sequences with merit factor greater than 9 were found.>