The following publications are possibly variants of this publication:
- 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 pseudorandom binary sequences derived from Euler quotientsZhixiong Chen, Xiaoni Du, Radwa Marzouk. aaecc, 26(6):555-570, 2015. [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]
- Further results on pseudorandom binary sequences derived from Fermat-Euler QuotientsZhifan Ye, Pinhui Ke, Zhixiong Chen. IEEEicics 2015: 1-4 [doi]
- Linear Complexity of Binary Sequences Derived from Polynomial QuotientsZhixiong Chen, Domingo Gomez-Perez. seta 2012: 181-189 [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]