Title of article
On the linear complexity of generalized cyclotomic sequences with the period image Original Research Article
Author/Authors
Tongjiang Yan، نويسنده , , Shengqiang Li، نويسنده , , Guozhen Xiao، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
7
From page
187
To page
193
Abstract
This letter contributes to the investigation of the linear complexity of generalized cyclotomic sequences with the period pmpm, which are contained by the sequences constructed by C. Ding and T. Helleseth in 1998, as a representative special case. The results obtained confirm that all of these sequences have high linear complexity.
Keywords
Minimal polynomials , Stream ciphers , Sequences , Cyclotomy , Linear complexity
Journal title
Applied Mathematics Letters
Serial Year
2008
Journal title
Applied Mathematics Letters
Record number
898552
Link To Document