DeepAI AI Chat
Log In Sign Up

A Note on the Games-Chan Algorithm

by   Graham H. Norton, et al.
The University of Queensland

The Games-Chan algorithm finds the minimal period of a periodic binary sequence of period 2^n, 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.


page 1

page 2


Corrigendum to New Generalized Cyclotomic Binary Sequences of Period p^2

New generalized cyclotomic binary sequences of period p^2 are proposed i...

No-three-in-line problem on a torus: periodicity

Let τ_m,n denote the maximal number of points on the discrete torus (dis...

A New Approach to Determine the Minimal Polynomials of Binary Modified de Bruijn Sequences

A binary modified de Bruijn sequence is an infinite and periodic binary ...

Isolating Bounded and Unbounded Real Roots of a Mixed Trigonometric-Polynomial

Mixed trigonometric-polynomials (MTPs) are functions of the form f(x,sin...

Efficient Algorithm for the Linear Complexity of Sequences and Some Related Consequences

The linear complexity of a sequence s is one of the measures of its pred...

A Note on the Period Enforcer Algorithm for Self-Suspending Tasks

The period enforcer algorithm for self-suspending real-time tasks is a t...

PPoL: A Periodic Channel Hopping Sequence with Nearly Full Rendezvous Diversity

We propose a periodic channel hopping (CH) sequence, called PPoL (Packin...