[1]BERLEKAMP S R. Algebraic coding theory [M]. New York: McGraw-Hill, 1968.[2]GAMES R A, CHAN A H. A fast algorithm for determining the complexity of a binary sequence with period 2^n [J]. IEEE Transactions on Information Theory, 1983, 29(1):144-146.[3]DING C S, XIAO G Z, SHAN W J. The stability theory of stream ciphers, LNCS 561 [M]. Berlin: Springer-Verlag, 1991.[4]STAMP M, MARTIN C F. An algorithm for the k-error linear complexity of binary sequences with period 2^n [J]. IEEE Transactions on Information Theory, 1993, 39(4): 1398-1401.[5]XIAO G Z, WEI S M, LAM K Y, et al. A fast algorithm for determining the linear complexity of a sequence with period p^n over GF(q) [J]. IEEE Transactions on Information Theory, 2000, 46(6): 2203-2206.[6]魏仕民,白国强,肖国镇.确定周期为p^n的二元周期序列的线性复杂度的一个快速算法[J].通信学报,1999,20(8):36-40.[7]王磊,张玉清,肖国镇.确定周期为p^n的二元序列的k-错线性复杂度的一个算法[J].通信学报,2001,22(4):91-95.[8]DING C. A fast algorithm for the determination of linear complexity of sequences over GF(p^m) with period p^n [M]// DING C S, XIAO G Z, SHAN W J. The stability theory of stream ciphers, LNCS 561. Berlin: Springer, 1991: 184-187.[9]WEI S M, XIAO G Z, CHEN Z. A fast algorithm for determining the linear complexity of a binary sequence with period 2^np^m [J]. Science in China, Series F, 2001, 44(6): 453-460.[10]ZHOU J Q, ZHENG Q. A fast algorithm for determining the linear complexity of periodic sequences over GF(3) [C]// Proceedings of the 5th International Conference on Cryptology and Network Security, LNCS 4301. Berlin: Springer-Verlag, 2006: 213-223.[11]ZHOU J Q. An algorithm for the k-error linear complexity of a sequence with period 2p^n over GF(q) [C]// IWSDA'07: Proceedings of the 3rd International Workshop on Signal Design and Its Applications in Communications. Washington, DC: IEEE Computer Society, 2007: 104-108.[12]KUROSAWA K, SATO F, SAKATA T. A relationship between linear complexity and k-error linear complexity [J]. IEEE Transactions on Information Theory, 2000, 46(2): 694-698.[13]MEIDL W. How many bits have to be changed to decrease the linear complexity? [J]. Designs, Codes and Cryptography, 2004, 33(2):109-122. |