On the 4-Adic Complexity of Quaternary Sequences with Ideal Autocorrelation

07/08/2021
by   Minghui Yang, et al.
0

In this paper, we determine the 4-adic complexity of the balanced quaternary sequences of period 2p and 2(2^n-1) with ideal autocorrelation defined by Kim et al. (ISIT, pp. 282-285, 2009) and Jang et al. (ISIT, pp. 278-281, 2009), respectively. Our results show that the 4-adic complexity of the quaternary sequences defined in these two papers is large enough to resist the attack of the rational approximation algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/21/2022

The 4-Adic Complexity of Interleaved Quaternary Sequences of Even Length with Optimal Autocorrelation

Su et al. proposed several new classes of quaternary sequences of even l...
research
12/11/2017

The linear complexity of new binary cyclotomic sequences of period p^n

In this paper, we determine the linear complexity of a class of new bina...
research
12/13/2019

Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of period of twin prime products

This paper contributes to compute 2-adic complexity of two classes of Di...
research
06/07/2020

Sumsets of Wythoff Sequences, Fibonacci Representation, and Beyond

Let α = (1+√(5))/2 and define the lower and upper Wythoff sequences by a...
research
02/24/2021

Further results on the 2-adic complexity of a class of balanced generalized cyclotomic sequences

In this paper, the 2-adic complexity of a class of balanced Whiteman gen...
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
03/01/2019

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