Author:
Kaida Takayasu,Uehara Satoshi,Imamura Kyoki
Reference9 articles.
1. Massey J.L. (1969) Shift register synthesis and BCH decoding. IEEE Trans, on Information Theory. IT-15, 122–127.
2. Stamp M., Martin C.F. (1993) An algorithm for the terror linear complexity of binary sequences with period 2n. IEEE Trans, on Information Theory. 39, 1398–1401.
3. Ding C., Xiao G., Shan W. (1991) The Stability Theory of Stream Ciphers. Lecture Notes in Compute Science, 561, Springer-Verlag.
4. Kaida T., Uehara S., Imamura K. (1999) An algorithm for the k-error linear complexity of sequences over GF(pm) with period p
n
, p a prime. Information and Computation. 151, Academic Press, 134–147.
5. Kaida T., Uehara S., Imamura K. (1999) A new algorithm for the k-error linear complexity of sequences over GF(p
m
) with period p
n
. Sequences and their Applications. Springer-Verlag, 284–296.