%0 Journal Article
%T A relationship between linear complexity and k-error complexity of binary periodic sequences<br>二元周期序列的线性复杂率与k-错复杂度的关系
%A Bai Enjian
%A Zhang Bin
%A Xiao Guozhen
%A <br>白恩健
%A 张斌
%A 肖国镇
%J 电子与信息学报
%D 2002
%I 
%X k-错复杂度是指改变序列一个周期段中k个或少于k个符号后所得序列的最小线性复杂度。该文讨论了周期为2~pq(q为奇素数,2是模q~2的本原根)的二元序列线性复杂度与k的关系,这里k是满足LC_k(S~N)
%K Periodic sequences
%K Linear complexity
%K fc-crror complexity<br>二元周期序列
%K 线性复杂度
%K k－错复杂度
%K 密钥流序列
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=392F30873A1A011C&yid=C3ACC247184A22C1&vid=B91E8C6D6FE990DB&iid=59906B3B2830C2C5&sid=0F1114F255AB647C&eid=4832190D43CC78F4&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=2&reference_num=5