The following publications are possibly variants of this publication:
- Linear Complexity of New Binary Sequence Derived From Polynomial Quotients Modulo p in General Case and Their GeneralizationsJiang Ma, Jun Zhang, Yanguo Jia, Xiumin Shen. access, 10:98855-98859, 2022. [doi]
- On the k-error linear complexity of binary sequences derived from polynomial quotientsZhixiong Chen, Zhihua Niu, Chenhuang Wu. chinaf, 58(9):1-15, 2015. [doi]
- On k-error linear complexity of pseudorandom binary sequences derived from Euler quotientsZhixiong Chen, Vladimir Edemskiy, Pinhui Ke, Chenhuang Wu. amco, 12(4):805-816, 2018. [doi]
- Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power ModulusLianhua Wang, Xiaoni Du. ijfcs, 31(5):569-581, 2020. [doi]
- On the linear complexity of binary threshold sequences derived from Fermat quotientsZhixiong Chen, Xiaoni Du. dcc, 67(3):317-323, 2013. [doi]
- Trace Representation of the Sequences Derived from Polynomial QuotientLiping Zhao, Xiaoni Du, Chenhuang Wu. icccsec 2018: 26-37 [doi]
- Some Notes on Pseudorandom Binary Sequences Derived from Fermat-Euler QuotientsZhifan Ye, Pinhui Ke, Shengyuan Zhang, Zuling Chang. ieicet, 98-A(10):2199-2202, 2015. [doi]
- Trace representation of pseudorandom binary sequences derived from Euler quotientsZhixiong Chen, Xiaoni Du, Radwa Marzouk. aaecc, 26(6):555-570, 2015. [doi]
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizationsXiaoni Du, Andrew Klapper, Zhixiong Chen. ipl, 112(6):233-237, 2012. [doi]