给出一个特殊周期序列GF(3)上周期为3pm的序列的K-错线性复杂度的快速算法,并讨论了它的正确性.其中p为素数,而且3是模p2的本原根.
This paper gave a fast algorithm of a special cycle sequence's K-error linear complexity,with GF(3) on the period of 3pm sequence,and its correctness was discussed,where p is prime,and 3 is a primitive root of modulo p2.