1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.SC2023
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…
cs.SC2015★ 1 cited
On Sequences, Rational Functions and Decomposition
Graham H. Norton
Our overall goal is to unify and extend some results in the literature related to the approximation of generating functions of finite and infinite sequences over a field by rationa…
cs.IT2010
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…