The Community for Technology Leaders
RSS Icon
Issue No.07 - July (1969 vol.18)
pp: 660-662
M. Cohn , IEEE
The construction of a shortest feedback shift register which generates a given finite sequence is described for the cases of linear and nonlinear feedback logic. It is shown that the ratio of the number of delay elements required in the linear case to that of the nonlinear case grows without bound for proper choice of sequences.
Finite sequences, linear and nonlinear feedback logic, short shift registers, worst linear case.
M. Cohn, S. Even, "The Design of Shift Register Generators for Finite Sequences", IEEE Transactions on Computers, vol.18, no. 7, pp. 660-662, July 1969, doi:10.1109/T-C.1969.222735
388 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool