The following publications are possibly variants of this publication:
- 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]
- On the linear complexity of binary threshold sequences derived from Fermat quotientsZhixiong Chen, Xiaoni Du. dcc, 67(3):317-323, 2013. [doi]
- Binary Threshold Sequences Derived from Carmichael Quotients with Even Numbers ModulusChenhuang Wu, Zhixiong Chen, Xiaoni Du. ieicet, 95-A(7):1197-1199, 2012. [doi]
- On the k-Error Linear Complexity of Binary Sequences Derived from the Discrete Logarithm in Finite FieldsZhixiong Chen, Qiuyan Wang. complexity, 2019, 2019. [doi]
- Linear Complexity of Pseudorandom Sequences Derived from Polynomial Quotients: General CasesXiaoni Du, Ji Zhang, Chenhuang Wu. ieicet, 97-A(4):970-974, 2014. [doi]
- Trace Representation of the Sequences Derived from Polynomial QuotientLiping Zhao, Xiaoni Du, Chenhuang Wu. icccsec 2018: 26-37 [doi]
- An extension of binary threshold sequences from Fermat quotientsXiaoni Du, Chenhuang Wu, Wanyin Wei. amco, 10(4):743-752, 2016. [doi]