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 cs.ITShow all

5 papers · 1 filter

cs.IT2021★ 2 cited

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…

cs.IT2021★ 1 cited

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.…

cs.IT2018

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.…

cs.IT2014

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…

cs.IT2013★ 1 cited

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…