The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (1978 vol.27)
pp: 1192-1195
F. Hemmati , 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 = q<sup>m</sup>, is obtained, where q is a power of a prime number, q = p<sup>n</sup>, 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, December 1978, doi:10.1109/TC.1978.1675025
55 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool