The Properties of the 1-error Linear Complexity of pn-periodic Sequences Over Fp

Ming Su, Lusheng Chen
{"title":"The Properties of the 1-error Linear Complexity of pn-periodic Sequences Over Fp","authors":"Ming Su, Lusheng Chen","doi":"10.1109/ISIT.2006.261899","DOIUrl":null,"url":null,"abstract":"Some properties of p<sup>n</sup>-periodic sequences over F<sub>p </sub> with fixed linear complexity value are found. Based on this, the distribution of the 1-error linear complexity of p<sup>n</sup>-periodic sequences over F<sub>p</sub> is provided. The expectation of the 1-error linear complexity of random p<sup>n</sup>-periodic sequences over F<sub>p</sub> is calculated and its estimated range is given. According to these results, an efficient algorithm for computing the 1-error linear complexity of a p<sup>n</sup>-periodic sequence, as well as a new algorithm for determining all the error vectors that give the 1-error linear complexity, is proposed","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2006.261899","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Some properties of pn-periodic sequences over Fp with fixed linear complexity value are found. Based on this, the distribution of the 1-error linear complexity of pn-periodic sequences over Fp is provided. The expectation of the 1-error linear complexity of random pn-periodic sequences over Fp is calculated and its estimated range is given. According to these results, an efficient algorithm for computing the 1-error linear complexity of a pn-periodic sequence, as well as a new algorithm for determining all the error vectors that give the 1-error linear complexity, is proposed
p -周期序列的1误差线性复杂度的性质
研究了具有固定线性复杂度值的p -周期序列的一些性质。在此基础上,给出了p -周期序列在Fp上的1误差线性复杂度分布。计算了随机p周期序列在Fp上的1误差线性复杂度的期望,并给出了其估计范围。根据这些结果,提出了一种计算p周期序列1误差线性复杂度的有效算法,以及一种确定给出1误差线性复杂度的所有误差向量的新算法
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信