期刊文献+

2~n-周期序列的k错线性复杂度期望的界 被引量:1

THE BOUNDS OF EXPECTED VALUE OF k-ERROR LINEAR COMPLEXITY OF 2~n-PERIODIC SEQUENCES
下载PDF
导出
摘要 对于有限域F2上的满线性复杂度的2n-周期序列和奇数k≥3,通过对k错线性复杂度的取值范围和相应的序列个数的分析,得到其k错线性复杂度期望的上界和下界。 For the 2n-periodic binary sequences with maximal linear complexity,the k-error linear complexity lie in some ranges,k≥3and k is an odd number,by research the number of sequences of each range,the upper and lower bounds of expected value of the k-error linear complexity of the specific periodic sequences are given.
作者 唐淼
出处 《巢湖学院学报》 2011年第3期1-4,共4页 Journal of Chaohu University
基金 安徽农业大学校青年科学基金资助项目(项目编号:2009zr29)
关键词 线性复杂度 K错线性复杂度 周期序列 linear complexity k-error linear complexity periodic sequences bound
  • 相关文献

参考文献8

  • 1MEIDLDI W,NIEDERREITER H.Countingfunctions andexpectedvalues for the k-error linear complexity. Finite Fields and Their Applications . 2002
  • 2N. Kalouptsidis.On the Quadratic Span of Binary Sequences. IEEE Transactions on Information Theory . 2005
  • 3Meidl W,Niederreiter H.Linear Complexity, k-error Linear Complexity, and the Discrete Fourier Transform. Journal of Complexity . 2002
  • 4Meidl W,Niederreiter H.Linear Complexity, k-error Linear Complexity, and the Discrete Fourier Transform. Journal of Complexity . 2002
  • 5Rueppel R A.Analysis and Design of Stream Ciphers. . 1986
  • 6Games RA,Chan AH.A fast algorithm for determining the complexity of a binary sequence with period 2n. IEEE Transactions on Information Theory . 1983
  • 7Stamp M,Martin CF.An algorithm for k-error linear complexity of binary sequences with period 2n. IEEE Transactions on Information Theory . 1993
  • 8Kurosawa K,Sato F,Sakata T,et al.A relationship between linear complexity and k-error linear complexity. IEEE Transactions on Information Theory . 2000

同被引文献9

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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