Title :
An algebraic construction for q-ary shift register sequences
Author :
Hemmati, F. ; Costello, D.J., Jr.
Author_Institution :
Department of Electrical Engineering, Illinois Institute of Technology
Abstract :
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.
Keywords :
Euclidean Algorithm; Hamming weight; maximal length cycle; shift register sequence; Euclidean Algorithm; Hamming weight; maximal length cycle; shift register sequence;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1978.1675025
