%0 Journal Article
%T m-tight error linear complexity of sequences over GF(pm) with period pn<br>GF(pm)上周期为pn序列的m紧错线性复杂度*
%A ZHOU Jian-qin
%A XIONG Wei
%A <br>周建钦
%A 熊微
%J 计算机应用研究
%D 2010
%I 
%X Using the theories of linear complexity, k-error linear complexity, the k-error linear complexity profile and the mi-nimum error, this paper presented the notion of m-tight error linear complexity. Moreover, gave an efficient algorithm for computing m-tight error linear complexity based on the algorithm for computing k-error linear complexity of sequences over GF(pm) with period pn, where p was a prime. It realized the proposed algorithm with C language, and also gave the experiment results here.
%K stream cipher
%K periodic sequence
%K linear complexity
%K k-error linear complexity
%K tight error linear complexity<br>流密码
%K 周期序列
%K 线性复杂度
%K k错线性复杂度
%K 紧错线性复杂度
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=695D465FAF4D59CE46E95B3151585C7E&yid=140ECF96957D60B2&vid=DB817633AA4F79B9&iid=9CF7A0430CBB2DFD&sid=BC313C827ECD4E48&eid=AC3EDB9EE9017BD9&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=9