论文信息 - A fast algorithm for determining the complexity of a binary sequence with period 2n - 字舞流文

A fast algorithm for determining the complexity of a binary sequence with period 2n

The complexity of a periodic sequence (s) is defined to be the least number of stages in a linear feedback shift register that generates (s) .

Richard A. Games | Agnes Hui Chan | A. Chan | R. Games

[1] Edwin L. Key,et al. An analysis of the structure and complexity of nonlinear binary sequence generators , 1976, IEEE Trans. Inf. Theory.

[2] James L. Massey,et al. Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[3] Edward J. Groth,et al. Generation of binary sequences with controllable complexity , 1971, IEEE Trans. Inf. Theory.