QQ客服 官方微博 反馈留言

	On the k-error linear complexity of binary sequences derived from polynomial quotients
	Chen ZhiXiong[1]; Niu ZhiHua[2]; Wu ChenHuang[3]
刊名	SCIENCE CHINA-INFORMATION SCIENCES
	2015
卷号	58
关键词	cryptography Fermat quotients polynomial quotients binary sequences linear complexity k-error linear complexity
ISSN号	1674-733X
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/2268699
专题	上海大学
作者单位	1.[1]Putian Univ, Sch Math, Putian 351100, Peoples R China. 2.[2]Shanghai Univ, Sch Comp Engn & Sci, Shanghai 200444, Peoples R China. 3.[3]Putian Univ, Sch Math, Putian 351100, Peoples R China.
推荐引用方式 GB/T 7714	Chen ZhiXiong[1],Niu ZhiHua[2],Wu ChenHuang[3]. On the k-error linear complexity of binary sequences derived from polynomial quotients[J]. SCIENCE CHINA-INFORMATION SCIENCES,2015,58.
APA	Chen ZhiXiong[1],Niu ZhiHua[2],&Wu ChenHuang[3].(2015).On the k-error linear complexity of binary sequences derived from polynomial quotients.SCIENCE CHINA-INFORMATION SCIENCES,58.
MLA	Chen ZhiXiong[1],et al."On the k-error linear complexity of binary sequences derived from polynomial quotients".SCIENCE CHINA-INFORMATION SCIENCES 58(2015).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。