Research on the first class m subsequence

	Research on the first class m subsequence
	Yingni DUAN; Haifeng ZHANG; Hong LV; Junchu FANG
	2012
会议名称	2012 8th International Conference on Computational Intelligence and Security, CIS 2012
会议录名称	Proceedings of the 2012 8th International Conference on Computational Intelligence and Security, CIS 2012
页码	503-506
会议日期	November 17, 2012 - November 18, 2012
会议地点	Guangzhou, Guangdong, China
出版地	2001 L Street N.W., Suite 700, Washington, DC 20036-4928, United States
出版者	IEEE Computer Society
会议主办者	Xidian University; Beijing Normal University; EEE CPS
产权排序	2
摘要	For the difficulty of pseudo-random sequence generation, on the basis of construction research of the first class m subsequence, this paper realizes m subsequence based on shift register theory and deduces feedback function expression of m subsequence and analyses linear complexity of sequence by applying B-M algorithm. The analysis shows that linear complexity of m subsequence is larger than linear complexity of m sequence, close to a half of m sequence period.
作者部门	飞行器光学成像与测量技术研究室
收录类别	CPCI（ISTP） ; EI
ISBN号	9780769548968
语种	英语
文献类型	会议论文
条目标识符	http://ir.opt.ac.cn/handle/181661/20915
专题	飞行器光学成像与测量技术研究室
推荐引用方式 GB/T 7714	Yingni DUAN,Haifeng ZHANG,Hong LV,et al. Research on the first class m subsequence[C]. 2001 L Street N.W., Suite 700, Washington, DC 20036-4928, United States:IEEE Computer Society,2012:503-506.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
Research on the firs（197KB）			限制开放	CC BY-NC-SA	请求全文