On k–error Linear Complexity of Zeng-Cai-Tang-Yang Generalized Cyclotomic Binary Sequences of Period $$p^2$$
Author:
Wu ChenhuangORCID,
Xu ChunxiangORCID
Publisher
Springer Singapore
Reference22 articles.
1. Chen, Z.: Trace representation and linear complexity of binary sequences derived from Fermat quotients. Sci. China Inf. Sci. 57(11), 1–10 (2014)
2. Chen, Z., Du, X.: On the linear complexity of binary threshold sequences derived from Fermat quotients. Des. Codes Cryptogr. 67(3), 317–323 (2013)
3. Lecture Notes in Computer Science;Z Chen,2012
4. Chen Z., Niu Z., Wu C.: On the $$k$$-error linear complexity of binary sequences derived from polynomial quotients. Sci. China Inf. Sci. 58(9), 092107:1–092107:15 (2015)
5. Lecture Notes in Computer Science;Z Chen,2010