m-Tight Error Linear Complexity of Sequences with Period 2pn over GF(q)
(1.College of Telecommunication,Hangzhou Dianzi University,Hangzhou 310018,China;2.College of Computer Science and Technology,Anhui University of Technology,Maanshan 243002,Anhui China)
[1] DING Cun-sheng,XIAO Guo-zhen,SHAN Wei-juan.The Stability Theory of Stream Ciphers [M].Springer Verlag：Lecture Notes in Computer Science,1991：561.[2] STAMP M,MARTIN C F.An Algorithm for the k-Error Linear Complexity of Binary Sequences with Period 2n [J].IEEE Trans. on Information Theory,1993,39(4):1 398-1 401.[3] GAMES R A,CHAN A H.A Fast Algorithm for Determining the Complexity Pseudo Random Sequence with Period 2n [J].IEEE Trans. on Information Theory,1983,29(1):144-146.[4] WEI Shi-min,XIAO Guo-zhen,CHEN Zhong.A Fast Algorithm for Determining the Minimal Polynomial of a Sequence with a Period 2pn Over GF(q) [J].IEEE Trans. on Information Theory,2002,48(10):2 754-2 758.[5] 戴小平,周建钦.求周期为2pm二元序列k错线性复杂度的快速算法 [J].兰州大学学报：自然科学版,2008,44(1):65-70.[6] KUROSAWA K,SATO F,SAKATA T,et al.A Relationship Between Linear Complexity and k-Error Linear Complexity [J].IEEE Trans. on Information Theory,2000,46(2):694-698.[7] LAUDER A,PATERSON K.Computing the Error Linear Complexity Spectrum of a Binary Sequence of Period 2n [J].IEEE Trans. on Information Theory,2003,49(1):273-280.[8] 魏仕民,肖国镇,陈钟.确定周期为2npm二元序列线性复杂度的快速算法 [J].中国科学：E辑,2002,32(3):401-408.
