39 citations · 71 across the 21 of their papers we have counts for
21 papers
Weak -Dirac manifolds
Yanhui Bi, Zhixiong Chen
In this paper, we introduce the notion of a weak -Dirac structure in , where . The weak -Lagrangian condition has more information…
Arithmetic crosscorrelation of pseudorandom binary sequences of coprime periods
Zhixiong Chen, Zhihua Niu, Arne Winterhof
The (classical) crosscorrelation is an important measure of pseudorandomness of two binary sequences for applications in communications. The arithmetic crosscorrelation is another…
Arithmetic Autocorrelation of Binary -Sequences
Zhixiong Chen, Zhihua Niu, Yuqi Sang +1
An -sequence is the one of the largest period among those produced by a linear feedback shift register. It possesses several desirable features of pseudorandomness such as balan…
Correlation measures of binary sequences derived from Euler quotients
Huaning Liu, Zhixiong Chen, Chenhuang Wu
Fermat-Euler quotients arose from the study of the first case of Fermat's Last Theorem, and have numerous applications in number theory. Recently they were studied from the cryptog…
Correlation, Linear Complexity, Maximum order Complexity on Families of binary Sequences
Zhixiong Chen, Ana I. Gómez, Domingo Gómez-Pérez +1
Correlation measure of order is an important measure of randomness in binary sequences. This measure tries to look for dependence between several shifted version of a sequence.…
On the 4-adic complexity of the two-prime quaternary generator
Vladimir Edemskiy, Zhixiong Chen
R. Hofer and A. Winterhof proved that the 2-adic complexity of the two-prime (binary) generator of period with two odd primes is close to its period and it can attai…
On -nearly bent Boolean functions
Zhixiong Chen, Andrew Klapper
For each non-constant Boolean function , Klapper introduced the notion of -transforms of Boolean functions. The {\em -transform} of a Boolean function is related to th…
On the -error linear complexity of binary sequences derived from the discrete logarithm in finite fields
Zhixiong Chen, Qiuyan Wang
Let be a power of an odd prime . We study binary sequences with entries in defined by using the quadratic character of the finite fiel…
The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude
Yuhua Sun, Tongjiang Yan, Zhixiong Chen
Recently, a class of binary sequences with optimal autocorrelation magnitude has been presented by Su et al. based on interleaving technique and Ding-Helleseth-Lam sequences (Des.…
On -error linear complexity of pseudorandom binary sequences derived from Euler quotients
Zhixiong Chen, Vladimir Edemskiy, Pinhui Ke +1
We investigate the -error linear complexity of pseudorandom binary sequences of period derived from the Euler quotients modulo , a power o…
On the -Bentness of Boolean Functions
Zhixiong Chen, Ting Gu, Andrew Klapper
For each non-constant in the set of -variable Boolean functions, the {\em -transform} of a Boolean function is related to the Hamming distances from to the functi…
On error linear complexity of new generalized cyclotomic binary sequences of period
Chenhuang Wu, Chunxiang Xu, Zhixiong Chen +1
We consider the -error linear complexity of a new binary sequence of period , proposed in the recent paper "New generalized cyclotomic binary sequences of period ", by…
Linear complexity of Legendre-polynomial quotients
Zhixiong Chen
We continue to investigate binary sequence over defined by for integers , where $\left(\frac{\cdot}{p}\…
Linear complexity of quaternary sequences over Z_4 derived from generalized cyclotomic classes modulo 2p
Zhixiong Chen, Vladimir Edemskiy
We determine the exact values of the linear complexity of 2p-periodic quaternary sequences over Z_4 (the residue class ring modulo 4) defined from the generalized cyclotomic classe…
Linear complexity and trace representation of quaternary sequences over based on generalized cyclotomic classes modulo
Zhixiong Chen
We define a family of quaternary sequences over the residue class ring modulo of length , a product of two distinct odd primes, using the generalized cyclotomic classes mod…
Linear complexity problems of level sequences of Euler quotients and their related binary sequences
Zhihua Niu, Zhixiong Chen, Xiaoni Du
The Euler quotient modulo an odd-prime power can be uniquely decomposed as a -adic number of the form $$ \frac{u^{(p-1)p^{r-1}} -1}{p^r}\equiv a_0(u)+a_1(u)p+\ldots+…
Trace representation of pseudorandom binary sequences derived from Euler quotients
Zhixiong Chen, Xiaoni Du, Radwa Marzouk
We give the trace representation of a family of binary sequences derived from Euler quotients by determining the corresponding defining polynomials. Trace representation can help u…
Polynomial quotients: Interpolation, value sets and Waring's problem
Zhixiong Chen, Arne Winterhof
For an odd prime and an integer , polynomial quotients are defined by $$ q_{p,w}(u)\equiv \frac{u^w-u^{wp}}{p} \bmod p ~~ \mathrm{with}~~ 0 \le q_{p,w}(u)…
A General Construction of Binary Sequences with Optimal Autocorrelation
Tongjiang Yan, Zhixiong Chen, Bao Li
A general construction of binary sequences with low autocorrelation are considered in the paper. Based on recent progresses about this topic and this construction, several classes…
Covering sets for limited-magnitude errors
Zhixiong Chen, Igor E. Shparlinski, Arne Winterhof
For a set $\cM=\{-μ,-μ+1,\ldots, λ\}\setminus\{0\}$ with non-negative integers not both 0, a subset $\cS$ of the residue class ring modulo an integer is cal…
Trace representation and linear complexity of binary sequences derived from Fermat quotients
Zhixiong Chen
We describe the trace representations of two families of binary sequences derived from Fermat quotients modulo an odd prime (one is the binary threshold sequences, the other is…