%0 Journal Article
%T 1-error Linear Complexity of pn-Periodic Sequences over Fp<br>Fp上pn-周期序列的1-错线性复杂度
%A Zhu Feng-xiang
%A Qi Wen-feng
%A <br>朱凤翔
%A 戚文峰
%J 电子与信息学报
%D 2007
%I 
%X The linear complexity and the k-error linear complexity of a periodic sequence are two important standards to scale the randomicity of keystreams. For a p^n -periodic sequence over Fp, the possible values of the 1-error linear complexity and the number of sequences with certain 1-error linear complexity are established. Moreover, the expected value of the 1-error linear complexity for a random p^n-periodic sequence over Fp is also given.
%K Linear complexity
%K 1-error linear complexity
%K Periodic sequence over F_p
%K Generalized Chan-Games algorithm<br>线性复杂度
%K 1-错线性复杂度
%K Fp上周期序列
%K 广义Chan-Games算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=DCA556B99ED69AD0&yid=A732AF04DDA03BB3&vid=771469D9D58C34FF&iid=9CF7A0430CBB2DFD&sid=BBE4941DB42FA885&eid=86C17F046E2342EE&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=0&reference_num=11