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 Systems Science & Complexityx
共 条 记 录，以下是1-5
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
FAMILIES OF p-ARY SEQUENCES WITH LOW CORRELATION AND LARGE LINEAR COMPLEXITY
《Journal of Systems Science & Complexity》2014年第6期1305-1319,共15页CAI Han ZENG Xiangyong HU Lei 
supported by the National Natural Science Foundation of China under Grant No.61170257;supported by the National Key Basic Research Program of China under Grant No.2013CB834203;the National Science Foundation of China under Grant Nos.10990011 and 61070172;the Strategic Priority Research Program of Chinese Academy of Sciences under Grant No.XDA06010702
This paper generalizes a method of generating shift sequences in the interleaved construction proposed by Gong.With the new shift sequences,some new families of p-ary sequences with desired properties can be obtained....
关键词：Auto-correlation CROSS-CORRELATION linear complexity low correlation p-ary sequence. 
DISTRIBUTION OF ONE-ERROR LINEAR COMPLEXITY OF BINARY SEQUENCES FOR ARBITRARY PRIME PERIOD
《Journal of Systems Science & Complexity》2012年第6期1223-1233,共11页Lin TAN Wenfeng QI Hong XU 
supported by the National Natural Science Foundation of China under Grant Nos.61070178, 61100200,and 60833008
Complexity measures for sequences, such as the linear complexity and the k-error linear complexity, play an important role in stream ciphers. This contribution studies the distribution of 1-error linear complexity of ...
关键词：k-error linear complexity linear complexity periodic sequences stream ciphers. 
BINARY SEQUENCE WITH PERFECT SPREADING STAIRCASE PROFILE OF LINEAR COMPLEXITY
《Systems Science and Mathematical Sciences》1997年第1期75-79,共5页YANG Yi-clan SUN Dengfeng (Department of Information Engineering, Beijing University of Posts & Telecommunications, Be iiing 100088 China) 
This paper makes the following investigations.1. To solve the second open problem proposed by M.Morii and M.Kasahar[1];2. To prove the nonexistence of PSSP sequence with the smallest(or biggest) density;3. To find the...
关键词：Linear complexity PSEUDO-RANDOM sequence colltinued FRACTION CRYPTOGRAPHY 
LINEAR COMPLEXITY AND THE MINIMAL POLYNOMIAL OF LINEAR RECURRING SEQUENCES OVER Z/(m)
《Systems Science and Mathematical Sciences》1991年第1期51-54,共4页戴宗铎 黄民强 
In this note we discuss the annihilating properties of sequences over Z/(m).Byconsidering the linear complexity and the annihilator structure,we derive the uniqueness conditionfor the minimal polynomial,and some relat...
关键词：Linear complexity OVER Z/(m) UNIQUENESS of MINIMAL polynomial 
LINEAR COMPLEXITY AND RANDOM SEQUENCES WITH PERIOD 2~n
《Systems Science and Mathematical Sciences》1990年第2期136-142,共7页章照止 杨义先 
This project was supported by National Natural Science Foundation of China
Let （?）=（S,S,…）be a binary random sequence with period N=2n,where S=(S0,…,SN-1)is its one period with N independent and uniformly distributed binary random variables.The main res...
关键词：Linear COMPLEXITY BOOLEAN funcation random SEQUENCE local COMPLEMENTATION 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部