Construction of de Bruijn sequences of minimal complexity
Abstract:
It is well known that the linear complexity of a de Bruijn sequenceSof length2^{n}is bounded below by2^{n- 1} + nforn geq 3. It is shown that this lower bound is attainable for alln.
