8 citations · 10 across the 7 of their papers we have counts for
7 papers
On Rueppel's Linear Complexity Conjecture
Graham H. Norton
Rueppel's conjecture on the linear complexity of the first terms of the sequence was first proved by Dai using the Euclidean algorithm. We…
A Note on the Games-Chan Algorithm
Graham H. Norton
The Games-Chan algorithm finds the minimal period of a periodic binary sequence of period , in iterations. We generalise this to periodic -ary sequences (where is a…
On Sequences with a Perfect Linear Complexity Profile
Graham H. Norton
We derive Bézout identities for the minimal polynomials of a finite sequence and use them to prove a theorem of Wang and Massey on binary sequences with a perfect linear complexity…
Bézout Identities Associated to a Finite Sequence
Graham H. Norton
We consider finite sequences where is a commutative, unital, integral domain. We prove three sets of identities (possibly with repetitions), each involving poly…
The Berlekamp-Massey Algorithm via Minimal Polynomials
Graham H. Norton
We present a recursive minimal polynomial theorem for finite sequences over a commutative integral domain . This theorem is relative to any element of . The ingredients are:…
Shortest Two-way Linear Recurrences
Graham H. Norton
Let be a finite sequence over a field of length . It is well-known that if satisfies a linear recurrence of order with non-zero constant term, then the reverse of $s…