The following publications are possibly variants of this publication:
- 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 Binary Sequences Derived from Polynomial QuotientsZhixiong Chen, Domingo Gomez-Perez. seta 2012: 181-189 [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]
- On k-Error Linear Complexity of Binary Sequences Derived From Euler Quotients Modulo 2pChenhuang Wu, Vladimir Edemskiy, Chunxiang Xu. access, 8:51477-51481, 2020. [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 and linear complexity of binary sequences derived from Fermat quotientsZhixiong Chen. chinaf, 57(11):1-10, 2014. [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]
- Trace Representation of the Sequences Derived from Polynomial QuotientLiping Zhao, Xiaoni Du, Chenhuang Wu. icccsec 2018: 26-37 [doi]