Determination of the Autocorrelation Distribution and 2-Adic Complexity of Generalized Cyclotomic Binary Sequences of Order 2 with Period pq

by   Xiaoyan Jing, et al.

The generalized cyclotomic binary sequences S=S(a, b, c) with period n=pq have good autocorrelation property where (a, b, c)∈{0, 1}^3 and p, q are distinct odd primes. For some cases, the sequences S have ideal or optimal autocorrelation. In this paper we determine the autocorrelation distribution and 2-adic complexity of the sequences S=S(a, b, c) for all (a, b, c)∈{0, 1}^3 in a unified way by using group ring language and a version of quadratic Gauss sums valued in group ring R=ℤ[Γ] where Γ is a cyclic group of order n.


page 1

page 2

page 3

page 4


Periodicity Analysis of the Logistic Map over Ring ℤ_3^n

Periodicity analysis of sequences generated by a deterministic system is...

Determination of 2-Adic Complexity of Generalized Binary Sequences of Order 2

The generalized binary sequences of order 2 have been used to construct ...

On the Cohomology of 3D Digital Images

We propose a method for computing the cohomology ring of three--dimensio...

Direct blockmodeling of valued and binary networks: a dichotomization-free approach

A long-standing open problem with direct blockmodeling is that it is exp...

Linear Complexity of Binary Interleaved Sequences of Period 4n

Binary periodic sequences with good autocorrelation property have many a...

Note about the linear complexity of new generalized cyclotomic binary sequences of period 2p^n

This paper examines the linear complexity of new generalized cyclotomic ...

Please sign up or login with your details

Forgot password? Click here to reset