DocumentCode
3406193
Title
About computation of the linear complexity of generalized cyclotomic sequences with period pq
Author
Edemskiy, Vladimir ; Antonova, Olga
Author_Institution
Novgorod State Univ., Veliky Novgorod, Russia
fYear
2011
fDate
10-14 Oct. 2011
Firstpage
9
Lastpage
12
Abstract
We propose a computation method for linear complexity of series of generalized cyclotomic sequences with period pq. This method is based on using the polynomial of the classical cyclotomic sequence, this allows to obtain well-known results and also new results. We found the linear complexity of Whiteman generalized cyclotomic sequences based on cyclotomic classes of order six.
Keywords
communication complexity; cryptography; number theory; polynomials; sequences; Whiteman generalized cyclotomic sequences; cyclotomic classes; linear complexity; polynomial; Complexity theory; Computers; Educational institutions; Galois fields; Polynomials; Sun; System-on-a-chip; generalized cyclotomic sequences; linear complexity;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Design and its Applications in Communications (IWSDA), 2011 Fifth International Workshop on
Conference_Location
Guilin
Print_ISBN
978-1-61284-047-5
Type
conf
DOI
10.1109/IWSDA.2011.6159449
Filename
6159449
Link To Document