This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
December 1978 (vol. 27 no. 12)
pp. 1192-1195
F. 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.
Index Terms:
shift register sequence, Euclidean Algorithm, Hamming weight, maximal length cycle
Citation:
F. Hemmati, D.J., Jr. Costello, "An Algebraic Construction for q-ary Shift Register Sequences," IEEE Transactions on Computers, vol. 27, no. 12, pp. 1192-1195, Dec. 1978, doi:10.1109/TC.1978.1675025
Usage of this product signifies your acceptance of the Terms of Use.