On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
暂无分享,去创建一个
[1] Solomon W. Golomb,et al. CYCLES FROM NONLINEAR SHIFT REGISTERS , 1959 .
[2] Marvin Perlman,et al. The Decomposition of the States of a Linear Feedback Shift Register Into Cycles of Equal Length , 1970, IEEE Transactions on Computers.
[3] E. B. Leach,et al. Regular sequences and frequency distributions , 1960 .
[4] B. Elspas,et al. The Theory of Autonomous Linear Sequential Networks , 1959 .
[5] Abraham Lempel,et al. On extremal factors of the de Bruijn graph , 1971 .
[6] F. G. Heath,et al. Counting with Feedback Shift Registers by Means of a Jump Technique , 1962, IRE Trans. Electron. Comput..
[7] Michael Yoeli. Counting with Nonlinear Binary Feedback Shift Registers , 1963, IEEE Trans. Electron. Comput..
[8] A. Lempel. m-ary closed sequences , 1971 .
[9] Morris Rubinoff,et al. Shifting counters , 1958, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.
[10] de Ng Dick Bruijn. A combinatorial problem , 1946 .
[11] P. R. Bryant,et al. Nonlinear Feedback Shift Registers , 1962, IRE Trans. Electron. Comput..