2-adic complexity of binary m-sequences
文献类型：期刊论文
| 作者 | Tian Tian ; Qi Wen-Feng |
| 刊名 | IEEE TRANSACTIONS ON INFORMATION THEORY
 |
| 出版日期 | 2010 |
| 卷号 | 56期号:1页码:450-454 |
| 关键词 | 2-adic complexity feedback with carry shift register (FCSR) sequences m-sequences |
| ISSN号 | 0018-9448 |
| 学科主题 | Computer Science, Information Systems; Engineering, Electrical & Electronic |
| 收录类别 | SCI,EI,ACM |
| 语种 | 英语 |
| WOS记录号 | WOS:000273134100032 |
| 公开日期 | 2011-05-24 |
| 附注 | Although 2-adic complexity was proposed more than ten years ago, even for m-sequences which are thought of as the most important linear recurring sequences, no theoretical results about their 2-adic complexity has been presented. In this paper, it is shown that for a binary m-sequence, its 2-adic complexity attains the maximum, which implies that no feedback with carry shift registers (FCSRs) with connection integer less than 2(2n-1) - 1 can generate m-sequences of order n. |
| 源URL | [http://124.16.136.157/handle/311060/10113]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Tian Tian,Qi Wen-Feng. 2-adic complexity of binary m-sequences[J]. IEEE TRANSACTIONS ON INFORMATION THEORY,2010,56(1):450-454. |
| APA | Tian Tian,&Qi Wen-Feng.(2010).2-adic complexity of binary m-sequences.IEEE TRANSACTIONS ON INFORMATION THEORY,56(1),450-454. |
| MLA | Tian Tian,et al."2-adic complexity of binary m-sequences".IEEE TRANSACTIONS ON INFORMATION THEORY 56.1(2010):450-454. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。