Skip to Main Content
The complexity and autocorrelation properties of de Bruijn sequences generated by an algorithm of Etzion and Lempel are investigated. While the autocorrelation results deviate from the behaviour expected for truly random sequences, the complexity distributions are very encouraging. Specifically, the minimum complexities are significantly greater than those of other de Bruijn sequences.
Date of Publication: September 25 1986