摘要
试图给出一类伪随机、变采样的钟控序列模型——复合钟控序列,并给出了它在某种条件下的极小多项式,从而得到了它的复杂度和周期.
This paper is actually a note and a proof about the results in paper (1). At present, most of the clock-controlled sequences discussed by researchers are interleaving structures of some m-sequences which are shift-equivalent. Paper(1)tries to give a pseudo-random interleaving structure of some m-sequences which are not shift-equivalent. We call the sequences generated by it multiplexed sequences contiollod by a clock and investigate their minimum polynomials under some simple conditions. Thus the complexities and periods of this class of sequences are found.
出处
《应用科学学报》
CAS
CSCD
1991年第1期8-16,共9页
Journal of Applied Sciences
关键词
钟控序列
序列密码
复杂度
linear shift register sequence, minimum polynomial, multiplexed sequence controlled by a clock, linear complexity.