Linear Complexity and Autocorrelation of Prime Cube Sequences

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.

Saved in:
Bibliographic Details
Published inApplied Algebra, Algebraic Algorithms and Error-Correcting Codes pp. 188 - 197
Main Authors Kim, Young-Joon, Jin, Seok-Yong, Song, Hong-Yeop
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Subjects
Binary Sequence
Fourth Term
Linear Complexity
Minimal Polynomial
Stream Cipher
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:9783540772231
3540772235
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-77224-8_23