咨询与建议

限定检索结果

文献类型

  • 1 篇 会议

馆藏范围

  • 1 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 1 篇 工学
    • 1 篇 计算机科学与技术...
    • 1 篇 网络空间安全

主题

  • 1 篇 a fast algorithm...

机构

  • 1 篇 research group o...
  • 1 篇 national key lab...

作者

  • 1 篇 guozhen xiao
  • 1 篇 zhong chen
  • 1 篇 shimin wei

语言

  • 1 篇 英文
检索条件"主题词=A Fast Algorithm for the k-error Linear Complexity of a Binary sequence"
1 条 记 录,以下是1-10 订阅
排序:
a fast algorithm for the k-error linear complexity of a binary sequence
A Fast Algorithm for the k-error Linear Complexity of a Bina...
收藏 引用
2001 International Conferences on Info-tech and Info-net
作者: Shimin WEI Zhong CHEN Guozhen XIAO Research Group of Information Security Department of Computer Science and TechniquePeking University National Key Lab of ISN Xidian University
An efficient algorithm is presented for computing the k-error linear complexity of a binary sequence with period p~n,where 2 is a primitive root modulo *** new algorithm is a generalization of an algorithm over a bina... 详细信息
来源: 评论