确定周期序列线性复杂度的快速算法
A fast algorithm for determining the linear complexity of periodic sequences
摘要:
给出了GF(q)上周期为qnpm的周期序列的线性复杂度和最小多项式的一个快速算法,其中p为素数,q为素数,且为模p2的原根.本文给出的算法推广了文献[4]中GF(q)上序列的周期为pm的算法和文献[5]中二元序列的周期为2npm的算法。当m=0时,该算法简化了广义Games-Chan算法。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。