期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一个改进的Stamp-Martin算法

One Modified Stamp-Martin Algorithm
下载PDF
导出
摘要 基于Stamp-Martin算法，进行了改进，提出了一种求二元2 n周期序列的错误线性复杂度谱的新算法。相比已有算法，新算法更加清晰简单，运算量小，能够快速有效的求出序列的错误线性复杂度谱，具有很好的应用价值。 Based on the Stamp-Martin algorithm, one new algorithm to compute the error linear complexity spectrum of binary 2n-periodic sequences was provided. This new algorithm was clearer and simpler than old algorithm and could quickly compute the error linear complexity spectrum of sequences.
作者 王宁 常祖领
机构地区 中原工学院理学院 郑州大学数学与统计学院
出处 《齐鲁工业大学学报》 2015年第4期85-88,共4页 Journal of Qilu University of Technology
基金 河南省教育厅项目(14A110022)
关键词 二元序列 错误线性复杂度谱 Stamp-Martin算法 binary sequence error linear complexity spectrum Stamp-Martin algorithm
分类号 TN918.1 [电子电信—通信与信息系统]
  • 相关文献

参考文献11

  • 1MENEZES A J,VAN OORSCHOT P C,VANSTONE S A.Handbook of applied cryptography[M].New York:Boca Raton,FL:CRC Press,1996.
  • 2RUPPEL R A.Analysis and design of stream ciphers[M].New York;Springer-Verlag,1986:12-19.
  • 3Massey J L.Shift register synthesis and BCH decoding[J].IEEE Transactions on Information Theory,1969,15(1):122—127.
  • 4GAMES R A,CHAN A H.A fast algorithm for determining the complexity of a pseudo-random sequence with period 2~n[J].IEEE Transactions on Information Theory,1983,29(1):144—146.
  • 5STAMP M..MARTIN C F.An algorithm for the linear complexity of binary sequences with period 2"[J].IEEE Transactions on Information Theory,1993,39(4):1398-1401.
  • 6LAUDER A,PATERSON K.Computing the error linear complexity spectrum of a binarysequence of period 2~n[J].IEEE Transactions on Information Theory,2003,49(1):273-280.
  • 7MEIDL W.NIEDERRETER H.Linear complexity,k-error linear complexity,and the discrete Fourier transform[J].Journal of Complexity,2002(18):87-103.
  • 8MEIDL W,NIEDERREITER H.On the expected value of the linear complexity and the k-error linear complexity of periodic sequences[J].IEEE Transactions on Information Theory,2002,48(11):2817-2825.
  • 9SALAGENA A.On the computation of the linear complexity and the k-error linear complexity of binary sequences with period a power of two[J],IEEE Transactions on Information Theory,2005,51(3):1145-1150.
  • 10MEIDL W,Venkateswarlu A.Remarks on the k-error linear complexity of p~n-periodic sequences[J].Designs,Codes and Cryptography,2007,42(2):181-193.

二级参考文献8

  • 1Zhu Fengxiang Qi Wenfeng.THE 2-ERROR LINEAR COMPLEXITY OF 2~n-PERIODIC BINARY SEQUENCES WITH LINEAR COMPLEXITY 2~n-1[J].Journal of Electronics(China),2007,24(3):390-395. 被引量：21
  • 2DING Cun-sheng, XIAO Guo-zhen. The stability theory of stream ci- phers [M]. Berlin: Springer-Verlag,1991.
  • 3STAMP M, MARTIN C F. An algorithm for the k-error linear com- plexity of binary sequences with period 2^n [ J]. IEEE Trans on Infor- mation Theory, 1993,39 (4) : 1398-1401.
  • 4KUROSAWA K,SATO F,SAKATA T, et al. A relationship between linear complexity and k-error linear complexity [ J]. I EEE Trans on Information Theory,2000,46(2):694-698.
  • 5MEIDL W. On the stability of 22^n-periodic binary sequences [ J ]. IEEE Trans on Information Theory ,2005,51 ( 3 ) : 1151 - 1155.
  • 6GAMES R A, CHAN A H. A fast algorithm for determining the com- plexity of a binary sequence with period 2^n [ J]. IEEE Trans on In- formation Theory, 1983,29 ( 1 ) : 144-146.
  • 7FU Fang-wei, NIEDERREITER H, SU Ming. The characterization of 2^n-periodic binary sequences with fixed 1-error linear complexity [ C ]//Proc of SETA. Berlin : Springer, 2006:88-103.
  • 8谭林,戚文峰.F2上2^n-周期序列的k-错误序列[J].电子与信息学报,2008,30(11):2592-2595. 被引量：13

共引文献1

齐鲁工业大学学报
2015年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部