On the k-error Linear Complexity of Sequences
暂无分享,去创建一个
[1] Mark Stamp,et al. An algorithm for the k-error linear complexity of binary sequences with period 2n , 1993, IEEE Trans. Inf. Theory.
[2] Guozhen Xiao,et al. A fast algorithm for determining the minimal polynomial where of a sequence with period 2pn over GF(q) , 2002, IEEE Trans. Inf. Theory.
[3] Satoshi Uehara,et al. An Algorithm for thek-Error Linear Complexity of Sequences over GF(pm) with Period pn, pa Prime , 1999, Inf. Comput..
[4] James L. Massey,et al. Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.
[5] Xiao Guo-zhen. An efficient algorithm for the k-error linear complexity of periodic sequences , 2001 .
[6] Kaoru Kurosawa,et al. A relationship between linear complexity and kapa-error linear complexity , 2000, IEEE Trans. Inf. Theory.
[7] Guozhen Xiao,et al. A Fast Algorithm for Determining the Linear Complexity of a Sequence with Period Over GF , 2000 .
[8] Cunsheng Ding,et al. The Stability Theory of Stream Ciphers , 1991, Lecture Notes in Computer Science.
[9] Wilfried Meidl,et al. How Many Bits have to be Changed to Decrease the Linear Complexity? , 2004, Des. Codes Cryptogr..
[10] Simon R. Blackburn,et al. A generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence , 1994, IEEE Trans. Inf. Theory.
[11] Joachim von zur Gathen,et al. Modern Computer Algebra , 1998 .
[12] Richard A. Games,et al. A fast algorithm for determining the complexity of a binary sequence with period 2n , 1983, IEEE Trans. Inf. Theory.
[13] Kenneth H. Rosen. Elementary Number Theory: And Its Applications , 2010 .