Zhixiong Chen

activity

20132023

most citedTrace representation and linear complexity of binary sequences derived from Fermat quotients

39 citations · 71 across the 21 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

math.CO2019

On $q$ -nearly bent Boolean functions

Zhixiong Chen, Andrew Klapper

For each non-constant Boolean function $q$ , Klapper introduced the notion of $q$ -transforms of Boolean functions. The {\em $q$ -transform} of a Boolean function $f$ is related to th…

cs.CR2019

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 $σ = (σ_{0}, σ_{1}, \dots)$ with entries in ${0, 1}$ defined by using the quadratic character $χ$ of the finite fiel…

On q-nearly bent Boolean functions

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

On $q$ -nearly bent Boolean functions

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