中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
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)
会议日期SEP 11-14,
会议地点Berlin, GERMANY
关键词correlation cyclotomy entropy function k-error linear complexity linear complexity periodic sequence
页码4687-4694
英文摘要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.
收录类别SCI,ISTP,EI,ACM,IEEE
会议主办者IEEE
会议录IEEE International Symposium on Information Theory - Proceedings
会议录出版者IEEE TRANSACTIONS ON INFORMATION THEORY
会议录出版地445 HOES LANE, PISCATAWAY, NJ 08855 USA
语种英语
ISSN号0018-9448
ISBN号9781424422579
WOS记录号WOS:000269839000025
源URL[http://124.16.136.157/handle/311060/8182]  
专题软件研究所_信息安全国家重点实验室_会议论文
推荐引用方式
GB/T 7714
Hu Honggang,Gong Guang,Feng Dengguo. new results on periodic sequences with large k-error linear complexity[C]. 见:16th IEEE International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC 05). Berlin, GERMANY. SEP 11-14,.

入库方式: OAI收割

来源:软件研究所

浏览0
下载0
收藏0
其他版本

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