论文信息 - The Linear Complexity of a Class of Binary Sequences with Three-Level Autocorrelation - 字舞流文

The Linear Complexity of a Class of Binary Sequences with Three-Level Autocorrelation

Hui Li | Tongjiang Yan | Yuhua Sun

[1] Solomon W. Golomb,et al. Binary Pseudorandom Sequences of Period 2n-1 with Ideal Autocorrelation , 1998, IEEE Trans. Inf. Theory.

[2] Cunsheng Ding,et al. Almost difference sets and their sequences with optimal autocorrelation , 2001, IEEE Trans. Inf. Theory.

[3] Tor Helleseth,et al. New cyclic relative difference sets constructed from d-homogeneous functions with difference-balanced property , 2005, IEEE Transactions on Information Theory.

[4] Cunsheng Ding,et al. Binary sequences with optimal autocorrelation , 2009, Theor. Comput. Sci..

[5] Amr M. Youssef,et al. Cryptographic properties of the Welch-Gong transformation sequence generators , 2002, IEEE Trans. Inf. Theory.

[6] Dieter Jungnickel,et al. Perfect and Almost Perfect Sequences , 1999, Discret. Appl. Math..

[7] Qi Wang,et al. The Linear Complexity of Some Binary Sequences With Three-Level Autocorrelation , 2010, IEEE Transactions on Information Theory.

[8] Hans Dobbertin,et al. New cyclic difference sets with Singer parameters , 2004, Finite Fields Their Appl..

[9] Leopold Bömer,et al. Complex sequences over GF(pM) with a two-level autocorrelation function and a large linear span , 1992, IEEE Trans. Inf. Theory.