On the linear complexity over F/sub p/ of M-ary Sidel'nikov sequences
Young Sik Kim, Jung-Soo Chung, Jong‐Seon No, Habong Chung · 2005
In this paper, we derive linear complexity over Fpof the M-ary Sidel'nikov sequences using discrete Fourier transform. As an example, we represent the linear complexity of the ternary Sidel'nikov sequences. It turned out that the ternary Sidel'nikov sequences have the linear complexity nearly close to their periods