LINEAR_COMPLEXITY

作品数：53被引量：78H指数：5
导出分析报告
相关作者：胡卫群岳勤更多>>
相关机构：南京航空航天大学南京林业大学更多>>
相关期刊：《The Journal of China Universities of Posts and Telecommunications》《Progress in Natural Science:Materials International》《Frontiers of Mathematics in China》《Journal of Southeast University(English Edition)》更多>>
相关基金：国家自然科学基金福建省自然科学基金国家重点基础研究发展计划国家教育部博士点基金更多>>
-
在结果中检索

检索结果分析

结果分析中...
选择条件：
  • 期刊=Journal of Electronics（China）x
共 条 记 录，以下是1-3
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
THE DISTRIBUTION FUNCTIONS FOR THE LINEAR COMPLEXITY OF PERIODIC SEQUENCES
《Journal of Electronics(China)》2012年第3期211-214,共4页Yang Minghui Zhu Shixin 
Supported by the National Natural Science Foundation of China (No. 60973125)
Linear complexity is an important standard to scale the randomicity of stream ciphers. The distribution function of a sequence complexity measure gives the function expression for the number of sequences with a given ...
关键词：Linear complexity Periodic sequences Discrete Fourier Transform (DFT) 
THE 2-ERROR LINEAR COMPLEXITY OF 2~n-PERIODIC BINARY SEQUENCES WITH LINEAR COMPLEXITY 2~n-1被引量：21
《Journal of Electronics(China)》2007年第3期390-395,共6页Zhu Fengxiang Qi Wenfeng 
the National Natural Science Foundation of China (No.60373092).
Linear complexity and k-error linear complexity of the stream cipher are two important standards to scale the randomicity of keystreams. For the 2n -periodicperiodic binary sequence with linear complexity 2n 1and k = ...
关键词：Linear complexity k-error linear complexity Periodic binary sequences Chan-Games algorithm 
THE APPLICATION OF LINEAR COMPLEXITY OF SEQUENCES TO LOWER BOUNDS ON THE MINIMUM DISTANCE OF CYCLIC CODES
《Journal of Electronics(China)》1990年第4期312-316,共5页李元兴 粱传甲 
Firstly,the Fourier transforms in finite fields and the concept of linear complexityof sequences are described.Then several known lower bounds on the minimum distance of cycliccodes are outlined.Finally,the minimum di...
关键词：CYCLIC CODES Linear COMPLEXITY FOURIER transforms 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部