A fast algorithm for determining the linear complexity of periodic sequences
| dc.creator | Zhou, Jianqin | |
| dc.date | 2005-12-10 | |
| dc.date.accessioned | 2026-07-07T06:53:49Z | |
| dc.date.available | 2026-07-07T06:53:49Z | |
| dc.description | A fast algorithm is presented for determining the linear complexity and the minimal polynomial of periodic sequences over GF(q) with period q n p m, where p is a prime, q is a prime and a primitive root modulo p2. The algorithm presented here generalizes both the algorithm in [4] where the period of a sequence over GF(q) is p m and the algorithm in [5] where the period of a binary sequence is 2 n p m . When m=0, the algorithm simplifies the generalized Games-Chan algorithm. | |
| dc.description | 7 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0512040 | |
| dc.identifier | http://arxiv.org/abs/cs/0512040 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/105722 | |
| dc.subject | Cryptography and Security | |
| dc.title | A fast algorithm for determining the linear complexity of periodic sequences | |
| dc.type | text |