An algebraic construction for q-ary shift register sequences
Farhad Hemmati, Daniel J. Costello · IEEE Transactions on Computers · 1978
Using the Euclidean Algorithm for polynomials over GF(q), an algebraic technique for the generation of q-ary shift register sequences of arbitrary length l, 1 ≤ l ≤ qm, is obtained, where q is a power of a prime number, q = pn, and m is the number of shift register stages.