CORC  > 软件研究所  > 软件所图书馆  > 期刊论文
on the k-error linear complexity of l-sequences
Tan Lin ; Qi Wen-Feng
刊名FINITE FIELDS AND THEIR APPLICATIONS
2010
卷号16期号:6页码:420-435
关键词Feedback with carry shift register l-Sequences Linear complexity k-Error linear complexity
ISSN号1071-5797
学科主题Mathematics, Applied; Mathematics
收录类别SCI,EI,SCIENCEDIRECT
语种英语
WOS记录号WOS:000283524700004
公开日期2011-05-24
附注This paper studies the stability of the linear complexity of l-sequences. Let (s) under bar be an I-sequence with linear complexity attaining the maximum per((s) under bar)/2 + 1. A tight lower bound and an upper bound on minerror((s) under bar), i.e., the minimal value k for which the k-error linear complexity of (s) under bar is strictly less than its linear complexity, are given. In particular, for an I-sequence (s) under bar based on a prime number of the form 2r + 1, where r is an odd prime number with primitive root 2, it is shown that minerror((s) under bar) is very close to r, which implies that this kind of I-sequences have very stable linear complexity. (C) 2010 Published by Elsevier Inc.
内容类型期刊论文
源URL[http://124.16.136.157/handle/311060/10135]  
专题软件研究所_软件所图书馆_期刊论文
推荐引用方式
GB/T 7714
Tan Lin,Qi Wen-Feng. on the k-error linear complexity of l-sequences[J]. FINITE FIELDS AND THEIR APPLICATIONS,2010,16(6):420-435.
APA Tan Lin,&Qi Wen-Feng.(2010).on the k-error linear complexity of l-sequences.FINITE FIELDS AND THEIR APPLICATIONS,16(6),420-435.
MLA Tan Lin,et al."on the k-error linear complexity of l-sequences".FINITE FIELDS AND THEIR APPLICATIONS 16.6(2010):420-435.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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


©版权所有 ©2017 CSpace - Powered by CSpace