2005/12/10 by Jianqin Zhou, Zhou, Jianqin
Computer Science · Engineering · #Algorithms and Data Compression #Coding theory and cryptography #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #cs.CR #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.cs/0512040
7 pages
arxiv created 2005/12/10 · openalex publication_date 2005/12/10 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.