The Community for Technology Leaders
Green Image
Issue No. 04 - April (1971 vol. 20)
ISSN: 0018-9340
pp: 456-459
A.R. Smith , IEEE
An r-ary shift-register sequence is desired that has arbitrary cycle length L=r<sup>k</sup>for arbitrary r and k, where k is the number of stages (degree) of the shift register. The existence of such sequences is established for "almost all" cycle lengths L. Furthermore, existence of such sequences which are "zero free" for almost all cycle lengths L is proved.
Coding theory, maximum-length cycle, shift-register sequence, zero free.
A.R. Smith, "General Shift-Register Sequences of Arbitrary Cycle Length", IEEE Transactions on Computers, vol. 20, no. , pp. 456-459, April 1971, doi:10.1109/T-C.1971.223265
177 ms
(Ver 3.3 (11022016))