位置:成果数据库 > 期刊 > 期刊详情页
Linear Complexity Problem of Binary Jacobi Sequence
  • 期刊名称:Wuhan University Journal of Natural Sciences
  • 时间:2012.12.12
  • 页码:481-484
  • 分类:TN918.4[电子电信—通信与信息系统;电子电信—信息与通信工程]
  • 作者机构:[1]College of Sciences,China University of Petroleum,Qingdao 266555,Shandong,China, [2]State Key Laboratory of Integrated Service Networks,Xidian University,Xi'an 710071,Shaanxi,China
  • 相关基金:Supported by the National Natural Science Foundation of China (61170319,61063041); the Natural Science Fund of Shandong Province (ZR2010FM017); the China Postdoctoral Science Foundation Funded Project(119103S148); the Fundamental Research Funds for the Central Universities(11CX04056A,10CX04038A)
  • 相关项目:几类伪随机序列的随机性研究
中文摘要:

这份报纸贡献一个二进制周期的 Jacobi 序列的线性复杂性的稳定性。由采用一双参考书序列,我们证明也就是,一个二进制 Jacobi 序列的线性复杂性由在一个时期长度改变它的很少位是不稳定的,修改序列的线性复杂性将远变得不到要求的值。

英文摘要:

This paper contributes to the stability of linear complexity of a binary periodic Jacobi sequence.By employing a pair of reference sequences,we prove that the linear complexity of a binary Jacobi sequence is unstable,namely,by changing its few bits in one-period length,the linear complexity of the modified sequences will become far less than the required value.

同期刊论文项目
期刊论文 29 会议论文 4
期刊论文 50 会议论文 1 获奖 2
同项目期刊论文