The following publications are possibly variants of this publication:
- 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]
- Linear complexity of binary sequences derived from Euler quotients with prime-power modulusXiaoni Du, Zhixiong Chen, Lei Hu. ipl, 112(14-15):604-609, 2012. [doi]
- An extension of binary threshold sequences from Fermat quotientsXiaoni Du, Chenhuang Wu, Wanyin Wei. amco, 10(4):743-752, 2016. [doi]
- Linear Complexity of Binary Sequences Derived from Polynomial QuotientsZhixiong Chen, Domingo Gomez-Perez. seta 2012: 181-189 [doi]
- Trace representation and linear complexity of binary sequences derived from Fermat quotientsZhixiong Chen. chinaf, 57(11):1-10, 2014. [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]
- Further results on pseudorandom binary sequences derived from Fermat-Euler QuotientsZhifan Ye, Pinhui Ke, Zhixiong Chen. IEEEicics 2015: 1-4 [doi]
- Trace representation of pseudorandom binary sequences derived from Euler quotientsZhixiong Chen, Xiaoni Du, Radwa Marzouk. aaecc, 26(6):555-570, 2015. [doi]