binary sequence meaning in Chinese
二进制序列
二元序列
Examples
- Among the algorithmic design , the corresponding solution to the problems of transforming from the real sequence to binary sequence and precision in the chaotic stream cipher is put forward , and more efficient algorithm and better randomness of key sequence are obtained
在算法的设计中，我们对混沌序列密码所面临的实数序列到二进制序列的转化和精度等问题采取了相应的解决方法，从而获得较高的算法执行效率和良好的密钥序列随机性。 - The security of the algorithm is analyzed from the randomness , linear complexity of the chaotic sequence and the intensity of initial key . the results show the randomness of the key sequence pass the frequency test , sequential test , poker test , autocorrelation test , runs test , etc . and the total level is better than the binary sequence generated by the prng of delphi 7 . 0 , logistic chaotic system and rc4 , the linear complexity comes up to the expectation , the initial key has very strong intensity
本文最后从混沌序列的随机性、线性复杂度和初始密钥的强度三个方面对算法进行了安全性分析，结果表明算法产生的密钥序列的随机性完全通过了频数检验、序列检验、扑克检验、自相关检验和游程检验等5种统计检验方法的检验，而且整体水平要好于delphi7 . 0中的伪随机数发生器、 logistic混沌系统和rc4三种方法产生的二进制序列，线性复杂度达到了数学期望值。 - This paper discussed the relation between autocorrelation and run - length of binary sequences , proved that there is no independence between autocorrelation and run - length , the autocorrelation not only determined the number of run on a period of sequence , but determined the number of run with length is one
摘要研究二元周期序列的自相关性与游程之间的关系，证明了二者并不完全独立，序列的自相关特性不仅能决定其周期圆上游程总数，而且完全决定了长度为1的游程个数。 - With pseudorandom binary sequence as inspiriting signal , feedback data is collected and time - domain and frequency - domain characteristic of the steering gear is analyzed . according to the results , system delay is determined . applying predictive error identification method , by comparing the different order model , model structure and parameters of the steering gear is determined
以伪随机二进制序列为激励信号,收集了反馈数据;利用收集的数据,对舵机进行了时域和频域特性分析;并以此为参考,确定了系统的延时量,应用预报误差的辨识方法,通过不同阶次模型间的比较,从而确定了舵机模型结构及参数。 - The results of author mainly includes : 1 . discussed the random evaluating indexs ? linear complexity . the author mainly discusses the linear complexity and k - error linear complexity of a binary sequence with the period n = npv ( n is a positive integer , p is an odd prime , gcd ( n , p ) = 1 ) , and show three important conclusions : a necessary and sufficient condition for lc k ( sn ) < lc ( sn ) , distributing of linear complexity about periodic sequence and a general upper bound for ( ) n 2
作者主要取得的研究成果如下: 1 .研究了伪随机序列伪随机性评估指标?线性复杂度,主要讨论了gf ( q )上的周期为n = npv的二进制周期序列线性复杂度与k -错线性复杂度之间的关系,得到了三个有用的结论,即lck ( sn ) < lc ( sn )的充分必要条件、周期序列线性复杂度的分布和( ) klcn , ks的一个可能的下界。