Computation of the k-error linear complexity of binary sequences with period 2n-Reference-Cited by-同舟云学术

Computation of the k-error linear complexity of binary sequences with period 2n

Published:1996 Issue: Volume: Page:182-191
ISSN:0302-9743
Container-title:Concurrency and Parallelism, Programming, Networking, and Security
language:
Short-container-title:

Author:

Kaida Takayasu,Uehara Satoshi,Imamura Kyoki

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0027791

Reference5 articles.

1. M. Stamp and C.F. Martin, “An algorithm for the k-error linear complexity of binary sequences with period 2n”, IEEE Trans. Inform. Theory, vol. 39, pp. 1398–1401, July 1993.

2. C. Ding, G. Xiao and W. Shan, The Stability Theory of Stream Ciphers, Lecture Notes in Computer Science 561, Springer-Verlag, Berlin, 1991.

3. R.A. Games and A.H. Chan, “A fast algorithm for determining the complexity of a pseudo-random sequences with period 2n”, IEEE Trans. Inform. Theory, vol. IT-29, pp. 144–146, Jan. 1983.

4. K. Imamura and T. Moriuchi, “A fast algorithm for determining the linear complexity of a p-ary sequence with period p n , p a prime”, (in Japanese), IEICE Technical Rept., vol. IT93-77, pp. 73–77, Dec. 1993.

5. T. Kaida, S. Uehara and K. Imamura, “An algorithm for the k-error linear complexity of sequences over GF(3) with period 3n”, Proc. 1996 Int'l Symp. Inform. Theory and Its Applications, pp. 155–158, Sep. 1996.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity;Sequences and Their Applications – SETA 2006;2006

2. On the Computation of the Linear Complexity and the k-Error Linear Complexity of Binary Sequences with Period a Power of Two;Sequences and Their Applications - SETA 2004;2005

3. A New Algorithm for the k -Error Linear Complexity of Sequences over GF(p m) with Period p n;Sequences and their Applications;1999