衡量一种流密码性能的指标有多个,其中密钥流 序列的线性复杂度(Linear Complexity)就是一个重要的度量指标。然而,密钥流 的线性复杂度是不稳定的,若周期序列中发生误码,可能会引起复杂度的骤降。
基于120个网页-相关网页
the linear complexity 线性复杂度
non-linear complexity 非线性复杂度
error linear complexity 错线性复杂度
joint linear complexity 联合线性复杂度
maximal linear complexity 极大线性复杂度
perfect linear complexity 完备线性复杂度序列
linear complexity profile 线性复杂度曲线
linear complexity profiles 线性复杂度谱
The linear complexity of the sequences has been determined.
并确定了该类序列的线性复杂度。
参考来源 - 伪随机序列设计及其随机性分析研究Results show that most of these sequences have good linear complexity.
结果表明该类序列具有较好的线性复杂度性质。
参考来源 - 一类新的六次剩余序列的线性复杂度 in C·2,447,543篇论文数据,部分数据来源于NoteExpress
Simultaneously, the sequences have a large period and high linear complexity.
同时广义互缩序列具有大的周期和高的线性复杂度。
Linear complexity and its robustness are important features of pseudo randomness.
线性复杂度及其稳定性是序列伪随机性的重要度量指标。
Weight complexity is an important index to measure the stability of linear complexity.
重量复杂度是度量序列线性复杂度稳定性的重要指标。
Right? If that was the case in that code, then my complexity is no longer log, because I need linear access for each time I've got to go to the list, and it's going to Lisp be much worse than that.
这里的复杂度不再是对数的了,因为每次在列表中,查找需要线性访问,可能还要糟糕,其实,有些编程语言,如。
In the linear case, meaning in the unsorted case what's the complexity of this? k times n, right? Order n to do the search, and I've got to do it k times, so this would be k times n.
复杂度是多少?k的n次方,对吧?,在序列n中做搜索,要做k次,所以是k的n次方次,如果先排序后搜索。
应用推荐