An algorithm for the k-error linear complexity of sequences over GF( p(m))with period p(n), p a prime

Authors
Kaida, T Uehara, S Imamura, K
Citation
T. Kaida et al., An algorithm for the k-error linear complexity of sequences over GF( p(m))with period p(n), p a prime, INF COMPUT, 151(1-2), 1999, pp. 134-147
Citations number
11
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
INFORMATION AND COMPUTATION
ISSN journal
08905401 → ACNP
Volume
151
Issue
1-2
Year of publication
1999
Pages
134 - 147
Database
ISI
SICI code
0890-5401(19990525)151:1-2<134:AAFTKL>2.0.ZU;2-P
Abstract
An algorithm is given for the k-error linear complexity of sequences over G F(p(m)) with period p(n), p a prime. The algorithm is derived by the genera lized Games-Chan algorithm for the linear complexity of sequences over GF(p (m)) with period p(n) and by using the modified cost different from that us ed in the Stamp-Martin algorithm for sequences over GF(2) with period 2(n). A method is also given for computing an error vector which gives the k-err or linear complexity. (C) 1999 Academic Press.