◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Zhixiong Chen

21 papers hereh-index 16755 citations88 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author3
  • first author11
  • middle author4
  • last author2

Across the 20 of 21 papers where every author was matched, so the position is known.

fields
  • cs.CR8
  • math.NT6
  • cs.IT5
  • math.CO1
  • math.DG1
same name
  • Zhixiong Chen — 8 papers, h 9
  • Zhixiong Chen — 3 papers, h 1
  • Zhixiong Chen — 3 papers, h 2
  • Zhixiong Chen — 3 papers, h 2
  • Zhixiong Chen — 2 papers, h 3
  • Zhixiong Chen — 1 paper

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

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

4 papers · 1 filter

cs.IT2021★ 2 cited

Arithmetic Autocorrelation of Binary m-Sequences

Zhixiong Chen, Zhihua Niu, Yuqi Sang +1

An m-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…

math.NT2021

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…

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 k is an important measure of randomness in binary sequences. This measure tries to look for dependence between several shifted version of a sequence.…

cs.CR2021

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 pq with two odd primes p=q is close to its period and it can attai…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.