ISCAS OpenIR
2-adic complexity of binary m-sequences
Tian Tian; Qi Wen-Feng
2010
SourceIEEE TRANSACTIONS ON INFORMATION THEORY
ISSN0018-9448
Volume56Issue:1Pages:450-454
Indexed Typesci,ei,acm
Keyword2-adic Complexity Feedback With Carry Shift Register (Fcsr) Sequences M-sequences
DepartmentTian, Tian; Qi, Wen-Feng Zhengzhou Informat Sci & Technol Inst, Dept Appl Math, Zhengzhou 450002, Peoples R China. Qi, Wen-Feng Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing, Peoples R China.
SubjectComputer Science, Information Systems ; Engineering, Electrical & Electronic
Language英语
WOS IDWOS:000273134100032
Citation statistics
Content Type期刊论文
URIhttp://ir.iscas.ac.cn/handle/311060/10113
Collection中国科学院软件研究所
Recommended Citation
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.
Files in This Item:
File Name/Size DocType Version Access License
2-adic complexity of(142KB) 开放获取--Application Full Text
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Tian Tian]'s Articles
[Qi Wen-Feng]'s Articles
Baidu academic
Similar articles in Baidu academic
[Tian Tian]'s Articles
[Qi Wen-Feng]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Tian Tian]'s Articles
[Qi Wen-Feng]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.