同时广义互缩序列具有大的周期和高的线性复杂度。
Simultaneously, the sequences have a large period and high linear complexity.
重量复杂度是度量序列线性复杂度稳定性的重要指标。
Weight complexity is an important index to measure the stability of linear complexity.
重量复杂度是度量序列线性复杂度稳定性的重要指标。
The result is an extention on weight complexity of a sequence with period 2 n.
线性复杂度及其稳定性是序列伪随机性的重要度量指标。
Linear complexity and its robustness are important features of pseudo randomness.
理论分析表明，该算法的时间复杂性接近于线性复杂度。
The theoretic analysis demonstrates that the time complexity of this algorithm is approximately linear.
提出了带记忆组合器的非线性复杂度和相关免疫阶的概念。
The concepts of nonlinear complexity and correlation immune order of combiner with memory are proposed in this paper.
本文利用线性复杂度曲线，讨论了序列的线性复杂度稳定性。
By using linear complexity profile. the stability of linear complexity of sequences is discussed.
讨论了三类达到极大线性复杂度的前馈阵列的输入阵列的结构。
The structures of input arrays of three classes of feedforward arrays with maximal linear complexities are discussed.
文章主要探讨序列的长度、线性复杂度以及跳跃复杂度之间的关系。
In this paper, we will research the connection between the length of sequence, linear complexity and jump complexity of sequence.
理论分析表明此密钥序列具有较高的线性复杂度和良好的密码学特性。
It is proved that series has high complexity and good cipher quality.
文章把线性复杂度理论检用于密码技术中，设计一种实用的序列随机性检验方法。
Linear complexity theory be applied to cryptographic technology, designing a testing method of a random sequence.
造自缩减序列的新方法，给出了这种方法产生的自缩减序列的周期和线性复杂度。
A new construct method of self-shrinking sequence is presented, the period and the linear complexity of sequences generated by the new method is give.
构造了一类非线性序列生成器，其生成的序列周期长，线性复杂度高，且可控制。
A class of nonlinear sequence generators of long period and high linear complexity are constructed.
进一步讨论了基于GF（3）上本原三项式和四项式的自缩序列的周期和线性复杂度。
Moreover, the period and linear complexity of the generated sequence based on primitive trinomials and quarternomials of degree nover GF(3) are discussed.
文章给出判定单体差和多体差存在冗余的充分必要条件，以及消除冗余的线性复杂度的算法。
The sufficient and necessary preconditions to identify redundancy for single and multiple iteration distances are given, and a linear ordered algorithm is described.
对于流密码体制中使用的伪随机序列，我们要求它既要有尽可能大的线性复杂度，又要能抗相关攻击。
For cryptologic applications, it is of course highly disirable that the linear complexities of pseudorandom sequences be as large as possible, and the sequences resist the correlation attack.
首先回顾了LDPC码的有效编码，然后在此基础上提出了一种应用于不等错误保护的线性复杂度编码方法。
This paper firstly overviews the efficient encoding of LDPC codes, based on which we proposes a linear encoding for UEP.
具有优良相关性，大线性复杂度，平衡性，长周期的伪随机序列广泛应用于CDMA系统，扩跳频通信系统。
Pseudo-random sequences with optimal properties such as correlation, high linear spans, balance and long period are widely used in CDMA system, spread spectrum and hopping communication systems.
分组算法被认为有可能降低经典的Shor算法复杂度至线性复杂度，且可能改善波粒二象计算机的计算能力。
The grouping algorithm might be used to reduce the complexity of the traditional Shor algorithm to linear complexity, and to enhance the calculate capacity of duality computers.
与传统直扩序列相比，混沌扩频序列具有非线性复杂度较高的优点，该优点同时也是盲估计混沌扩频序列的难点。
Chaotic direct sequence spread spectrum (CD3S) signal is more nonlinear and more complex than the conventional direct sequence spread spectrum signal.
为了增大混沌跳频码的周期和非线性复杂度，我们利用多个不同混沌映射组成一个级联混沌映射，并用来设计跳频码。
In order to enhance the nonlinearity and period length, different chaotic maps are combined into a cascaded chaotic map to design FH codes.
分析了已有的序列线性复杂度分析方法，提出了用近似熵算法计算混沌运动的测度熵，作为衡量混沌伪随机序列复杂度的标准。
In this paper, the conventional pseudo-random sequence linear complexity is discussed, and a new criterion is proposed, based on the approximate entropy.
的位置并去访问，然后继续下去，也就意味着，找到数组中的第i个元素的方法，是关于数组的长度呈线性复杂度的，这回增加算法的复杂度。
I've got to count my way down, which means that the access would be linear in the length of the list to find the I 'th element of the list, and that's going to increase the complexity.
该方法有效地避免了一般复用距离分析可能导致的内存溢出问题，同时使得复用距离分析达到线性时间复杂度。
This method avoids possible memory overflow problem in normal reuse distance analysis, at the same time this method makes complexity of reuse distance analysis decrease to linear.
该方法关于数据库的大小、属性个数具有近似线性时间复杂度，这使得算法具有好的扩展性。
The method has the nearly linear time complexity with the size of dataset and the number of attributes. This results in good scalability.
为了解决这个问题，本文提出一种新的模式合一算法，共时间复杂度为线性的。
To solve the problem, this paper proposes a new pattern unification algorithm, which time complexity is linear.
该方法可以把状态的复杂度控制在和状态属性相关的线性级别，可以尽早发现与状态相关的错误。
The method can control the complexity of state within the linear scope related with state attribute, and it can find the faults and mistakes related with state earlier.
针对该问题，基于具有线性编码复杂度的迭代编码算法，提出了一种改进的PEG构造算法。
To solve such a problem, this paper presents an improved PEG algorithm which can be encoded by the iterative encoding algorithm with linear coding complexity.
本文提出了一种改进的细分嵌入算法——端点外接圆法(ETCM)，该算法具有线性时间复杂度。
An improved algorithm of node refinement scheme called endpoint triangle's circumcircle method (ETCM) is proposed, which has a linear time complexity.
本文提出了一种改进的细分嵌入算法——端点外接圆法(ETCM)，该算法具有线性时间复杂度。
An improved algorithm of node refinement scheme called endpoint triangle's circumcircle method (ETCM) is proposed, which has a linear time complexity.
应用推荐