Corrigendum to New Generalized Cyclotomic Binary Sequences of Period p^2

07/09/2018
by   Zibi Xiao, et al.
0

New generalized cyclotomic binary sequences of period p^2 are proposed in this paper, where p is an odd prime. The sequences are almost balanced and their linear complexity is determined. The result shows that the proposed sequences have very large linear complexity if p is a non-Wieferich prime.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/24/2018

Linear complexity of generalized cyclotomic sequences of period 2p^m

In this paper, we construct two generalized cyclotomic binary sequences ...
research
05/07/2020

Binary sequences derived from differences of consecutive quadratic residues

For a prime p> 5 let q_0,q_1,...,q_(p-3)/2 be the quadratic residues mod...
research
08/31/2022

A Note on the Games-Chan Algorithm

The Games-Chan algorithm finds the minimal period of a periodic binary s...
research
09/11/2018

Shift-Inequivalent Decimations of the Sidelnikov-Lempel-Cohn-Eastman Sequences

We consider the problem of finding maximal sets of shift-inequivalent de...
research
05/28/2021

4-Adic Complexity of Interleaved Quaternary Sequences

Tang and Ding <cit.> present a series of quaternary sequences w(a, b) in...
research
12/22/2021

Comparing balanced ℤ_v-sequences obtained from ElGamal function to random balanced sequences

In this paper, we investigate the randomness properties of sequences in ...
research
10/09/2019

Implementation of irreducible Sobol sequences in prime power bases

We present different implementations for the irreducible Sobol (IS) sequ...

Please sign up or login with your details

Forgot password? Click here to reset