1999年5月
An algorithm for the k-error linear complexity of sequences over GF( p(m)) with period p(n), p a prime
INFORMATION AND COMPUTATION
- ,
- ,
- 巻
- 151
- 号
- 1-2
- 開始ページ
- 134
- 終了ページ
- 147
- 記述言語
- 英語
- 掲載種別
- その他
- DOI
- 10.1006/inco.1998.2768
- 出版者・発行元
- ACADEMIC PRESS INC
An algorithm is given for the k-error linear complexity of sequences over GF(p(m)) with period p(n), p a prime. The algorithm is derived by the generalized 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 used 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-error linear complexity. (C) 1999 Academic Press.
- リンク情報
- ID情報
-
- DOI : 10.1006/inco.1998.2768
- ISSN : 0890-5401
- CiNii Articles ID : 10022173538
- Web of Science ID : WOS:000080826100010