2022/08/31 by Graham H. Norton, Norton, Graham H.
Computer Science · #Algorithms and Data Compression #Cellular Automata and Applications #Coding theory and cryptography #FOS: Computer and information sciences #Symbolic Computation (cs.SC)
paper · pdf · doi:10.48550/arxiv.2209.00148
openalex publication_date 2022/08/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The Games-Chan algorithm finds the minimal period of a periodic binary sequence of period 2n, in n iterations. We generalise this to periodic q-ary sequences (where q is a prime power) using generating functions and polynomials and apply this to find the multiplicity of x-1 in a q-ary polynomial f in log q°(f) iterations.