On the linear complexity of some new q-ary sequences

Authors:
Xiaoni Du;Zhixiong Chen;Guozhen Xiao
Affiliations:
College of Mathematics and Information Science, Northwest Normal University, Lanzhou, Gansu 730070, PR China and National Key Laboratory of ISN, Xidian University, Xi'an, Shaanxi 710071, PR China;Department of Mathematics, Putian University, Putian, Fujian 351100, PR China;National Key Laboratory of ISN, Xidian University, Xi'an, Shaanxi 710071, PR China
Venue:
Information Sciences: an International Journal
Year:
2008

Citing 11
Cited 1

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
Optimum OVSF code reassignment in wideband CDMA forward radio link

Information Sciences: an International Journal
Sequences related to Legendre/Jacobi sequences

Information Sciences: an International Journal
Q-ary cascaded GMW sequences

IEEE Transactions on Information Theory
Relationships between m-sequences over GF(q) and GF(qm)

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
GMW sequences (Corresp.)

IEEE Transactions on Information Theory
Complex sequences over GF(pM) with a two-level autocorrelation function and a large linear span

IEEE Transactions on Information Theory

Studies on the distribution of the shortest linear recurring sequences

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

Some new q-ary sequences with period q^3^e^k-1 (q=p^m, p an odd prime, m, e, k integers) are first constructed and then, inspired by Antweiler's method, their linear complexity is examined. The exact value of linear complexity k(6e)^w is determined when r=@?"i"="1^wp^e^"^i. Furthermore, an upper bound of the linear complexity is given for the other values of r. Our results show that this sequence has larger linear span than GMW sequence with the same parameters. Finally, the results of a Maple program are included to illustrate the validity of the results.