Linear complexity and autocorrelation of prime cube sequences

Authors:
Young-Joon Kim;Seok-Yong Jin;Hong-Yeop Song
Affiliations:
Department of Electrical and Electronic Engineering, Yonsei University, Seoul, Korea;Department of Electrical and Electronic Engineering, Yonsei University, Seoul, Korea;Department of Electrical and Electronic Engineering, Yonsei University, Seoul, Korea
Venue:
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Year:
2007

Citing 4
Cited 5

Shift Register Sequences

Shift Register Sequences
Autocorrelation and Linear Complexity of the New Generalized Cyclotomic Sequences

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Linear complexity of new generalized cyclotomic sequences of order two of length pq

IEEE Transactions on Information Theory
New Generalized Cyclotomy and Its Applications

Finite Fields and Their Applications

On the autocorrelation and the linear complexity of q-ary prime n-square sequences

SETA'10 Proceedings of the 6th international conference on Sequences and their applications
About computation of the linear complexity of generalized cyclotomic sequences with period pn+1

Designs, Codes and Cryptography
New classes of quaternary cyclotomic sequence of length 2pm with high linear complexity

Information Processing Letters
A generalization of the Hall's sextic residue sequences

Information Sciences: an International Journal
On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length 2pm

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

We review a binary sequence based on the generalized cyclotomy of order 2 with respect to p3, where p is an odd prime. Linear complexities, minimal polynomials and autocorrelation of these sequences are computed.