Characterizations of generators for modified de Bruijn sequences
暂无分享，去创建一个
[1] Richard A. Games,et al. On the Complexities of de Bruijn Sequences , 1982, J. Comb. Theory, Ser. A.
[2] Tuvi Etzion,et al. On the distribution of de Bruijn sequences of given complexity , 1984, IEEE Trans. Inf. Theory.
[3] Willi Meier,et al. Nonlinearity Criteria for Cryptographic Functions , 1990, EUROCRYPT.
[4] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[5] G. Hardy. The Theory of Numbers , 1922, Nature.
[6] O. S. Rothaus,et al. On "Bent" Functions , 1976, J. Comb. Theory, Ser. A.
[7] Neal Zierler,et al. On Primitive Trinomials (Mod 2) , 1968, Inf. Control..
[8] H. Fredricksen. A Survey of Full Length Nonlinear Shift Register Cycle Algorithms , 1982 .
[9] Solomon W. Golomb,et al. Shift Register Sequences , 1981 .
[10] Irving S. Reed,et al. A class of multiple-error-correcting codes and the decoding scheme , 1954, Trans. IRE Prof. Group Inf. Theory.
[11] de Ng Dick Bruijn. A combinatorial problem , 1946 .
[12] Solomon W. Golomb. On the classification of balanced binary sequences of period 2n-1 (Corresp.) , 1980, IEEE Trans. Inf. Theory.