A Note on the Games-Chan Algorithm

08/31/2022
by   Graham H. Norton, et al.
0

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.

READ FULL TEXT

page 1

page 2

research
07/09/2018

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

New generalized cyclotomic binary sequences of period p^2 are proposed i...
research
01/25/2019

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

Let τ_m,n denote the maximal number of points on the discrete torus (dis...
research
02/03/2022

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 ...
research
01/14/2023

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

Mixed trigonometric-polynomials (MTPs) are functions of the form f(x,sin...
research
12/25/2019

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...
research
03/13/2023

Periodic handover skipping in cellular networks: Spatially stochastic modeling and analysis

Handover (HO) management is one of the most crucial tasks in dense cellu...
research
06/14/2016

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

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

Please sign up or login with your details

Forgot password? Click here to reset