An Algorithm for the k-Error Linear Complexity of Sequences over GF(pm) with Period pn, p a Prime

Information and Computation

Volumn 151, Issue 1-2, 1999, Pages 134-147

  Kaida, Takayasu ^a   Uehara, Satoshi ^b   Imamura, Kyoki ^b  

^a KUMAMOTO NATIONAL COLLEGE OF TECHNOLOGY   (Japan)

^b KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Games Chan algorithm; k error linear complexity; Sequence over GF(pm) with period pn; Stamp Martin algorithm

Indexed keywords

EID: 0000926227     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2768     Document Type: Article

References (11)

1. [Bla94] Blackburn, S. R. (1994), A generalisation of the discrete Fourier transform: Determining the minimal polynomial of a periodic sequence, IEEE Trans. Inform. Theory 40, 1702-1704.
2. [DI98] Dai, Z., and Imamura, K. (1998), Linear complexity for one-symbol substitution of a periodic sequence over GF(q), IEEE Trans. Inform. Theory 44, 1328-1331.
3. [DXS91] Ding, C., Xiao, G., and Shan, W. (1991), "The Stability Theory of Stream Ciphers," Lecture Notes in Computer Science, Vol. 561, Springer-Verlag, New York/Berlin.
4. n, IEEE Trans. Inform. Theory IT-29, 144-146.
5. n, p a Prime," IEICE Tech. Rep. IT93-75, 73-78.
6. n, in "Proc. 1996 Int'l Symp. Inform. Theory and Its Applications," pp. 155-158.
7. n, in "Concurrency and Parallelism, Programming, Networking, and Security" (J. Jaffar and R. H. C. Yap, Eds.), Lecture Notes in Computer Science, Vol. 1179, pp. 182-191, Springer-Verlag, New York/Berlin.
8. n, IEEE Trans. Inform. Theory 39, 1398-1401.
9. n - 1 by one-symbol insertion, IEICE Trans. E79-A, 1739-1740.
10. n - 1 by one-symbol deletion, IEICE Trans. E80-A, 1164-1166.
11. n, p a prime, IEICE Trans. E80-A, 920-921.