Error Decomposition Algorithm for Approximating the k-Error Linear Complexity of Periodic Sequences
暂无分享,去创建一个
[1] Ana Salagean,et al. An approximation algorithm for computing the k-error linear complexity of sequences using the discrete fourier transform , 2008, 2008 IEEE International Symposium on Information Theory.
[2] Richard A. Games,et al. A fast algorithm for determining the complexity of a binary sequence with period 2n , 1983, IEEE Trans. Inf. Theory.
[3] Harald Niederreiter,et al. The Characterization of 2n-Periodic Binary Sequences with Fixed 1-Error Linear Complexity , 2006, SETA.
[4] Mark Stamp,et al. An algorithm for the k-error linear complexity of binary sequences with period 2n , 1993, IEEE Trans. Inf. Theory.
[5] Ming Su,et al. The Properties of the 1-error Linear Complexity of pn-periodic Sequences Over Fp , 2006, 2006 IEEE International Symposium on Information Theory.
[6] Ana Salagean,et al. A genetic algorithm for computing the k-error linear complexity of cryptographic sequences , 2007, 2007 IEEE Congress on Evolutionary Computation.
[7] Ana Salagean,et al. An Improved Approximation Algorithm for Computing the k-Error Linear Complexity of Sequences Using the Discrete Fourier Transform , 2010, SETA.
[8] Ming Su. Decomposing Approach for Error Vectors of k-Error Linear Complexity of Certain Periodic Sequences , 2014, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..
[9] Harald Niederreiter,et al. On the expected value of the linear complexity and the k-error linear complexity ofperiodic sequences , 2002, IEEE Trans. Inf. Theory.
[10] Cunsheng Ding,et al. The Stability Theory of Stream Ciphers , 1991, Lecture Notes in Computer Science.
[11] Ana Salagean,et al. Modified Berlekamp-Massey Algorithm for Approximating the k -Error Linear Complexity of Binary Sequences , 2007, IMACC.
[12] Takayasu Kaida. On the Generalized Lauder-Paterson Algorithm and Profiles of the k-Error Linear Complexity for Exponent Periodic Sequences , 2004, SETA.
[13] Satoshi Uehara,et al. An Algorithm for thek-Error Linear Complexity of Sequences over GF(pm) with Period pn, pa Prime , 1999, Inf. Comput..
[14] James L. Massey,et al. Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.