8 citations · 10 across the 7 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
cs.IT2009
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…
cs.IT2009★ 2 cited
Minimal Polynomial Algorithms for Finite Sequences
Graham H. Norton
We show that a straightforward rewrite of a known minimal polynomial algorithm yields a simpler version of a recent algorithm of A. Salagean.