Issue No. 12 - December (1978 vol. 27)
Farhad Hemmati , Department of Electrical Engineering, Illinois Institute of Technology
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.
shift register sequence, Euclidean Algorithm, Hamming weight, maximal length cycle
F. Hemmati and D. J. Costello, "An algebraic construction for q-ary shift register sequences," in IEEE Transactions on Computers, vol. 27, no. 12, pp. 1192-1195, .