A fast algorithm for determining the complexity of a binary sequence with period2^n(Corresp.)

Abstract

The complexity of a periodic sequence <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(s)</tex> is defined to be the least number of stages in a linear feedback shift register that generates <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(s)</tex> .