q-ary generalized shrinking generator
J4
• Original Articles • Previous Articles Next Articles
GAO Jun-tao;DONG Li-hua;HU Yu-pu
Received:
Revised:
Online:
Published:
Abstract: For providing a good sequence generator, we design the q-ary generalized shrinking generator by combining the ideas of the filter function generator and the clock-control generator. We show that the sequences family generated has a good correlation and takes on the linear space or an Abel group on condition that the clock-controlled sequence is an m-sequence. If the clock-controlled sequence is a generalized self-shrinking sequence the k-error linear complexity of sequences is very large. Simultaneously, the sequences have a large period and high linear complexity. All of the above shows that the q-ary generalized shrinking generator can be used as the key generator.
Key words: generzlized shrinking sequence, k-error linear complexity, correlation q-ary
CLC Number:
GAO Jun-tao;DONG Li-hua;HU Yu-pu.
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/Y2005/V32/I2/294
The linear complexity and the k-error linear complexity of pn-periodic binary sequences
A fast algorithm for determining the k-error linear complexity profile of a q-ary sequence with a period pn
Cited
On globally exponential convergence of a matrix differential equation