On the Linear Complexity of Some Ternary Sequences with Ideal Autocorrelation

Authors:
Xiaoni Du;Yu Zhou;Rong Sun;Guozhen Xiao
Affiliations:
-;-;-;-
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2008

Citing 6
Cited 0

A simple unpredictable pseudo random number generator

SIAM Journal on Computing
A New Family of Ternary Sequences with IdealTwo-level Autocorrelation Function

Designs, Codes and Cryptography
Shift Register Sequences

Shift Register Sequences
Q-ary cascaded GMW sequences

IEEE Transactions on Information Theory
p-ary unified sequences: p-ary extended d-form sequences with the ideal autocorrelation property

IEEE Transactions on Information Theory
New nonbinary sequences with ideal two-level autocorrelation

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this letter, we examine the linear complexity of some 3-ary sequences, proposed by No, of period 3n-1(n = 3ek, e, k integer) with the ideal autocorrelation property. The exact value of linear complexity k(6e)w is determined when the parameter r = Σi=1w 3ei. Furthermore, the upper bound of the linear complexity is given when the other forms of the value r is taken. Finally, a Maple program is designed to illustrate the validity of the results.