ISCAS OpenIR
expected values for the rational complexity of finite binary sequences
Tian Tian; Qi Wen-Feng
2010
SourceDESIGNS CODES AND CRYPTOGRAPHY
ISSN0925-1022
Volume55Issue:1Pages:65-79
Indexed Typesci,ei,acm
KeywordFeedback With Carry Shift Registers 2-adic Complexity Rational Complexity
DepartmentTian, Tian; Qi, Wen-Feng Zhengzhou Informat Sci & Technol Inst, Dept Appl Math, Zhengzhou, Peoples R China. Qi, Wen-Feng Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing, Peoples R China.
SubjectComputer Science, Theory & Methods ; Mathematics, Applied
Language英语
WOS IDWOS:000274238100006
Citation statistics
Content Type期刊论文
URIhttp://ir.iscas.ac.cn/handle/311060/9710
Collection中国科学院软件研究所
Recommended Citation
GB/T 7714
Tian Tian,Qi Wen-Feng. expected values for the rational complexity of finite binary sequences[J]. DESIGNS CODES AND CRYPTOGRAPHY,2010,55(1):65-79.
APA Tian Tian,&Qi Wen-Feng.(2010).expected values for the rational complexity of finite binary sequences.DESIGNS CODES AND CRYPTOGRAPHY,55(1),65-79.
MLA Tian Tian,et al."expected values for the rational complexity of finite binary sequences".DESIGNS CODES AND CRYPTOGRAPHY 55.1(2010):65-79.
Files in This Item:
File Name/Size DocType Version Access License
expected values for (232KB) 开放获取--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.