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 2017Show all

3 papers · 1 filter

cs.CR2017

On the $q$ -Bentness of Boolean Functions

Zhixiong Chen, Ting Gu, Andrew Klapper

For each non-constant $q$ in the set of $n$ -variable Boolean functions, the {\em $q$ -transform} of a Boolean function $f$ is related to the Hamming distances from $f$ to the functi…

cs.CR2017

On error linear complexity of new generalized cyclotomic binary sequences of period $p^{2}$

Chenhuang Wu, Chunxiang Xu, Zhixiong Chen +1

We consider the $k$ -error linear complexity of a new binary sequence of period $p^{2}$ , proposed in the recent paper "New generalized cyclotomic binary sequences of period $p^{2}$ ", by…

cs.CR2017★ 1 cited

Linear complexity of Legendre-polynomial quotients

Zhixiong Chen

We continue to investigate binary sequence $(f_{u})$ over ${0, 1}$ defined by $(- 1)^{f_{u}} = (\frac{( u ^{w} - u ^{w p} ) / p}{p})$ for integers $u \geq 0$ , where $\left(\frac{\cdot}{p}\…

On the q-Bentness of Boolean Functions

On error linear complexity of new generalized cyclotomic binary sequences of period p2

Linear complexity of Legendre-polynomial quotients

On the $q$ -Bentness of Boolean Functions

On error linear complexity of new generalized cyclotomic binary sequences of period $p^{2}$