Funder
Natural Science Foundation of Shandong Province
The Fundamental Research Funds for the Central Universities
Fujian Provincial Key Laboratory of Nenwork Security and Cryptology Research Fund (Fujian Normal University)
Qingdao application research on special independent innovation plan project
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications
Reference32 articles.
1. Cai, Y., Ding, C.: Binary sequences with optimal autocorrelation. Theor. Comput. Sci. 410, 2316–2322 (2009)
2. Ding, C., Helleseth, T., Lam, K.Y.: Several classes of sequences with three-level autocorrelation. IEEE Trans. Inform. Theory 45, 2606–2612 (1999)
3. Ding, C., Helleseth, T., Shan, W.: On the linear complexity of Legendre sequences. IEEE Trans. Inform. Theory 45, 693–698 (1998)
4. Edemskiy, V., Palvinskiy, A.: The linear complexity of binary sequences of length 2p with optimal three-level autocorrelation. Inf. Process. Lett. 116, 153–156 (2016)
5. Etzion, T.: Linear complexity of de Bruijn sequences-old and new results. IEEE Trans. Inform. Theory 45, 693–698 (1999)
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献