A new search for skewsymmetric binary sequences with optimal merit factors

  • Authors:
  • M. J.E. Golay;D. B. Harris

  • Affiliations:
  • Perkin-Elmer Corp., Norwalk, CT;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 754.84

Visualization

Abstract

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