new results on periodic sequences with large k-error linear complexity

ISCAS OpenIR > 信息安全国家重点实验室

	new results on periodic sequences with large k-error linear complexity
	Hu Honggang; Gong Guang; Feng Dengguo
	2009
会议名称	16th IEEE International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC 05)
会议录名称	IEEE International Symposium on Information Theory - Proceedings
页码	4687-4694
会议日期	SEP 11-14,
会议地点	Berlin, GERMANY
收录类别	sci,istp,ei,acm,ieee
出版地	445 HOES LANE, PISCATAWAY, NJ 08855 USA
出版者	IEEE TRANSACTIONS ON INFORMATION THEORY
ISSN	0018-9448
ISBN	9781424422579
部门归属	Hu, Honggang; Feng, Dengguo Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China. Hu, Honggang; Gong, Guang Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada.
摘要	Niederreiter showed that there is a class of periodic sequences which possess large linear complexity and large k-error linear complexity simultaneously. This result disproved the conjecture that there exists a trade-off between the linear complexity and the k-error linear complexity of a periodic sequence by Ding et al. By considering the orders of the divisors of x(N)-1 over F-q, we obtain three main results which hold for much larger k than those of Niederreiter et al.: a) sequences with maximal linear complexity and almost maximal k-error linear complexity with general periods; b) sequences with maximal linear complexity and maximal k-error linear complexity with special periods; c) sequences with maximal linear complexity and almost maximal k-error linear complexity in the asymptotic case with composite periods. Besides, we also construct some periodic sequences with low correlation and large k-error linear complexity.
关键词	Correlation Cyclotomy Entropy Function K-error Linear Complexity Linear Complexity Periodic Sequence
主办者	IEEE
语种	英语
WOS记录号	WOS:000269839000025
引用统计
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/8182
专题	信息安全国家重点实验室
推荐引用方式 GB/T 7714	Hu Honggang,Gong Guang,Feng Dengguo. new results on periodic sequences with large k-error linear complexity[C]. 445 HOES LANE, PISCATAWAY, NJ 08855 USA:IEEE TRANSACTIONS ON INFORMATION THEORY,2009:4687-4694.