J4
• Original Articles • Previous Articles Next Articles
The linear complexity of new Ding-generalized cyclotomic sequences of order 2k of length pq
LI Sheng-qiang;WANG Xiao-fen;XIAO Guo-zhen
Received:
Revised:
Online:
Published:
Abstract: Linear complexity is the most important index for measuring the randomness properties of sequences. Based on the Ding-generalized cyclotomy, new generalized cyclotomic sequences of order 2k of length pq are constructed by finding out a special characteristic set. The linear complexity of the sequences is determined. The minimum of the linear complexity is (n-1)/2 and the maximum of the linear complexity is n. And the sequences are balanced.
Key words: Ding-generalized cyclotomy, characteristic set, linear complexity
CLC Number:
LI Sheng-qiang;WANG Xiao-fen;XIAO Guo-zhen.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://journal.xidian.edu.cn/xdxb/EN/
https://journal.xidian.edu.cn/xdxb/EN/Y2006/V33/I2/322
Linear complexity of binary whiteman generalized cyclotomic sequences
q-ary generalized shrinking generator
The linear complexity and the k-error linear complexity of pn-periodic binary sequences
Stabilities of period and linear complexity of the self-shrinking sequence
A fast algorithm for determining the k-error linear complexity profile of a q-ary sequence with a period pn
The self-editing generator
Cited
Convertible designated confirmer partially blind signatures
