expected values for the rational complexity of finite binary sequences

ISCAS OpenIR

	expected values for the rational complexity of finite binary sequences
	Tian Tian; Qi Wen-Feng
	2010
发表期刊	DESIGNS CODES AND CRYPTOGRAPHY
ISSN	0925-1022
卷号	55 期号:1 页码:65-79
收录类别	sci,ei,acm
关键词	Feedback With Carry Shift Registers 2-adic Complexity Rational Complexity
部门归属	Tian, 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.
学科领域	Computer Science, Theory & Methods ; Mathematics, Applied
语种	英语
WOS记录号	WOS:000274238100006
引用统计
内容类型	期刊论文
URI标识	http://ir.iscas.ac.cn/handle/311060/9710
专题	中国科学院软件研究所
推荐引用方式 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.