A New Algorithm for the k -Error Linear Complexity of Sequences over GF(p m) with Period p n-Reference-Cited by-同舟云学术

A New Algorithm for the k -Error Linear Complexity of Sequences over GF(p m) with Period p n

Published:1999 Issue: Volume: Page:284-296
ISSN:
Container-title:Sequences and their Applications
language:
Short-container-title:

Author:

Kaida Takayasu,Uehara Satoshi,Imamura Kyoki

Publisher

Springer London

Link

http://link.springer.com/content/pdf/10.1007/978-1-4471-0551-0_21.pdf

Reference15 articles.

1. J.L. Massey,Shift register synthesis and BCH decoding,IEEE trans. Inform. Theory IT-15 (1969),122–127.

2. W.H. Mills Continued fractions and linear recurrences Math. of Computation, 29 (1975), 173–180.

3. J.L. Massey and T. Schaub Linear complexity in coding theory, Lecture Notes in Computer Science 331 (1986), 19–32.

4. Z. Dai and K. Imamura, Linear complexity for one-symbol substitution of a periodic sequence over GF(q), IEEE pans. Inform. Theory 44 (1998), 1328–1331.

5. S. Uehara and K. Imamura, Linear complexity of periodic sequences obtained from GF(q) sequences with period q n -1 by one-symbol insertion, IEICE Trans. E79-A (1996), 1739–1740.

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

1. On the k-error Joint Linear Complexity and Error Multisequence over F q (char F q = p, prime);Communications in Computer and Information Science;2014

2. An algorithm fork-error joint linear complexity of binary multisequences;Journal of Discrete Mathematical Sciences and Cryptography;2008-06

3. Remarks on the k-error linear complexity of p n -periodic sequences;Designs, Codes and Cryptography;2006-11-14

4. On the Generalized Lauder-Paterson Algorithm and Profiles of the k-Error Linear Complexity for Exponent Periodic Sequences;Sequences and Their Applications - SETA 2004;2005

5. On the Profile of the k-Error Linear Complexity and the Zero Sum Property for Sequences over GF(p m ) with Period p n;Sequences and their Applications;2002