linear complexity中文是什么意思

发音:

中文翻译
造句

线性复杂度

complexity n. 1.复杂性，复合状态。 2.复合物；复杂的事物[情况]。
advancing complexity 进化综合
algorithm complexity 算法复杂性
algorithmic complexity 算法复杂性
asymptotic complexity 渐近复杂性
aufwand complexity 复杂性
business complexity 业务复杂性
chemical complexity 化学复杂度
circuit complexity 电路复杂性
clonal complexity 克隆复杂性
code complexity 代码复杂性
cognitive complexity 认知复杂性
complexity analysis 成分分析
complexity class 复杂度类; 复杂性类
complexity factor 复杂度系数; 复杂性因子; 复杂性指示; 复杂因数
complexity graph 复杂性图形
complexity measure 复杂性度量
complexity metrics 复杂性度量
complexity of computation 计算的复杂性; 计算复杂性
complexity of computing 计算复杂性
complexity of emotion 情绪的复杂性
complexity of interface 接口复杂性
complexity of processes 过程的复杂性
computational complexity 计算复杂性; 计算量
computing complexity 计算复杂性

"查查词典"手机版

千万人都在用的超大词汇词典翻译APP

例句与用法

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)
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)
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)
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)
2 . in chapter three, the results show that, on condition that the clock-controlled sequence is m sequences, the generalized shrinking sequences have large period and linear complexity, good correlation property, and the generalized shrinking sequences family has rich algebra structure
在第三章提出并研究了广义互缩序列，研究表明生成的序列具有大的周期和线性复杂度，其中在被控序列为n级m序列的情况下证明了如下的结果：族内序列具有良好的互相关性质以及丰富的代数结构。
This thesis sets out from the two generation methods of non-linear long periodic sequence, analyzes the correlation of the pieces of long periodic non-linear compound codes by confidence interval estimation and massey algorithm . based on the analysis results, this thesis summarizes two basic rules-the linear complexity of the compound codes and the correlation of the pieces of long period codes are both improved with the increase of the length of partial m sequence . and then, the general methods of the generation of long periodic non-linear codes with special characters are presented
本文由两种非线性长序列的构造方法出发，利用区间估计的方法和梅西算法，分析长周期非线性序列的局部互相关特性和线性复杂度，再以多个序列的性能分析结果为指导，总结出序列的局部互相关特性随子序列m序列的截段长度的增加而改善和序列的线性复杂度随子序列m序列的截段长度的增加而增加这两条基本规律，进而提出构造满足人们不同要求的非线性长周期序列的一般思路。
In the design and analysis of sequence cipher, we obtain the following results . first, we give the trace representation of primitive sequences and their corresponding highest lever sequences on galois ring by using the trace function theory and the characteristic of lever factorization, and determine the correlation function linear complexity and element distribution of the highest lever sequences of primitive sequences on galois ring gr ( 4, m )
在序列密码的设计和分析方面：首先，利用galois环上迹函数理论和本原序列的权位分解特征，给出了本原序列及其最高权位序列的迹表达式，然后利用galois域上二次型理论与指数和理论决定了特征为4的galois环上本原序列的最高权位的相关函数、线性复杂度和元素分布。
2 . a characterization of the minimal polynomials generated a sequence with given minimal period is proved, the distribution of the linear complexity of periodic sequences is shown, and a new solving process of mathematical expectation and variance of linear complexity of periodic sequences is presented . randomness of minimal periodic sequences is discussed
给出生成给定最小周期序列的极小多项式的一个充分和必要条件；给出一般有限域上周期序列的线性复杂度的分布，并给出其数学期望和方差的一个新的求法，讨论了最小周期序列的随机性。
2 . a characterization of the minimal polynomials generated a sequence with given minimal period is proved, the distribution of the linear complexity of periodic sequences is shown, and a new solving process of mathematical expectation and variance of linear complexity of periodic sequences is presented . randomness of minimal periodic sequences is discussed
给出生成给定最小周期序列的极小多项式的一个充分和必要条件；给出一般有限域上周期序列的线性复杂度的分布，并给出其数学期望和方差的一个新的求法，讨论了最小周期序列的随机性。

更多例句： 1 2 3 4

推荐英语阅读

linear complexity的中文翻译，linear complexity是什么意思，怎么用汉语翻译linear complexity，linear complexity的中文意思，linear complexity的中文，linear complexity in Chinese，linear complexity的中文，linear complexity怎么读，发音，例句，用法和解释由查查在线词典提供，版权所有违者必究。

Last modified time:Tue, 19 Aug 2025 00:29:56 GMT