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

多维序列扩域k错F_q线性复杂度的近似算法 被引量：1

An approximation algorithm for computing the extension field k-error F_q-linear complexity of multisequences
下载PDF
导出
摘要 对于有限域Fq上周期为N的多维序列,p为Fq的特征,当N与p互素时,定义了多维序列的扩域k错Fq线性复杂度,并用广义离散傅里叶变换的方法给出了多维序列扩域k错Fq线性复杂度的近似算法。 For the multisequences of period N over the finite filed Fq with characteristic p,gcd（N,p）=1,the notion of the extension field k-error Fq-linear complexity was defined and an approximation algorithm for computing the k-error Fq-linear complexity of the multisequences was given using the generalized discrete Fourier transform.
作者 朱士信 杨名慧
机构地区 合肥工业大学数学学院 东南大学移动通信国家重点实验室
出处 《中国科学技术大学学报》 CAS CSCD 北大核心 2013年第3期202-205,211,共5页 JUSTC
基金 国家自然科学基金(60973125) 教育部高校博士点基金(20080359003)资助
关键词 周期多维序列 k错Fq线性复杂度 广义离散傅里叶变换 periodic multisequences k-error Fq-linear complexity generalized discrete Fourier transform
分类号 TN918.4 [电子电信—通信与信息系统]
  • 相关文献

参考文献9

  • 1Meidl W. On the stability of 2n-periodic binary sequences[J]. IEEE Trans Information Theory, 2005, 51 (3): 1 151-1 155.
  • 2Meidl W, Niederreiter H. On the expected value of the linear complexity and the k-error linear complexity of periodic sequences [J]. IEEE Trans Information Theory, 2005,48 (11): 2817-2825.
  • 3Niederreiter H, Paschinger H. Counting functions and the expected values in the stability theory of stream ciphers [C]/ / Sequences and Their Application. London: Springer, 1998: 318-329.
  • 4Games R A, Chan A H. A fast algorithm for determining the complexity of a binary sequence with period 2^n[J]. IEEE Trans Information Theory, 1983, 29 (1): 144-146.
  • 5Stamp M, Martin C F. An algorithm for the k-error linear complexity of binary sequences with period 2n [J]. IEEE Trans Information Theory, 1993, 39(4): 1 398-1 40l.
  • 6Ding C, Xiao G, Shan W. The Stability Theory of Stream Ciphers[M], Berlin: Springer, 1991.
  • 7Meidl W, Niederreiter H, Venkateswarlul A Error linear complexity measures for multisequences [J]. Journal of Complexity, 2007, 23(2): 169-192.
  • 8Alecu A, Salagean A An approximation algorithm for computing the k-error linear complexity of sequences using the discrete fourier transform[C]// Proceedings of the IEEE International Symposium on Information Theory, Toronto, Canada, 2008: 2414-2418.
  • 9Meidl W, Niederreiter H. The expected value of the joint linear complexity of periodic multisequences[J]. Journal of Complexity, 2003, 19(1): 61-72.

同被引文献8

  • 1Ding C S, Xiao G Z, Shan W J. The Stability Theory of Stream Ciphers[ M]. Berlin: Springer-Verlag, 1991: Chapter 5.
  • 2Stamp M, Martin C F. An algorithm for the k-error linear complexity of binary sequences with period 2" [J]. IEEE Transactions on Information Theory, 1993, 39(4): 1 398-1 401.
  • 3Games R A, Chan A H. A fast algorithm for determining the linear complexity of a binary sequence with period 2" [J]. IEEE Transactions on Information Theory, 1983, IT29(1) :144-146.
  • 4Imamura K, Moriuchi T. A fast algorithm for determining the linear complexity of p-ary sequence with period p", p a prime [J]. 1EICE Technical Report, 1993, IT93-75:73 -78.
  • 5Kaida T, Uehara S, Imamura K. An algorithm for the k-error linear compl.exity of sequences over GF(3) with period 3" [ C]// Proceedings of the International Symposium on Information Theory and Its Applications. IEEE, 1996: 155-158.
  • 6Kaida T, Uehara S, Imamura K. An algorithm for the k error linear complexity of sequences over GF (p") with period p" [J]. Information and Computation, 1999, 151(2): 134-147.
  • 7Lauder A G B, Paterson K G. Computing the error linear complexity spectrum of a binary sequence of period 2" [J]. IEEE Transactions on Information Theory, 2003, 49(1): 273-280.
  • 8Kaida T. On the generalized Lauder-Paterson algorithm and profiles of the k-error linear complexity for exponent periodic sequences[C]// Sequences and Their Applications - SETA 2004, LNCS 3486. Heidelberg: Springer, 2005: 166-178.

引证文献1

二级引证文献1

中国科学技术大学学报
2013年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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