I. Introduction
For a period sequence over a finite field , its linear complexity is defined to be the length of the shortest linear feedback shift register to generate it, i.e., the smallest positive integer such that there exist some in and hold for all . The polynomial is called the minimal connection polynomial [12].