On the $k$-error linear complexity of binary sequences derived from the discrete logarithm in finite fields

Zhixiong Chen, Qiuyan Wang

Let $q=p^r$ be a power of an odd prime $p$. We study binary sequences $\sigma =({\sigma }_0,{\sigma }_1,\dots )$ with entries in $\{0,1\}$ defined by using the quadratic character $\chi$ of the finite fiel…