CONSTRUCTION OF DEBRUIJN SEQUENCES OF MINIMAL COMPLEXITY

[1] ON THE COMPLEXITIES OF DEBRUIJN SEQUENCES [J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 1982, 33 (03) : 233 - 246

[2] Elspas B., 1959, IRE T CIRCUIT THEORY, V6, P45, DOI DOI 10.1109/TCT.1959.1086506

[3] ETZION T, UNPUB J COMBIN THE A

[4] A SURVEY OF FULL LENGTH NON-LINEAR SHIFT REGISTER CYCLE ALGORITHMS [J]. SIAM REVIEW, 1982, 24 (02) : 195 - 221

[5] A FAST ALGORITHM FOR DETERMINING THE COMPLEXITY OF A BINARY SEQUENCE WITH PERIOD 2N [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (01) : 144 - 146

[6] Golomb S., 1982, SHIFT REGISTER SEQUE

[7] Lempel A., 1970, IEEE Transactions on Computers, VC-19, P1204, DOI 10.1109/T-C.1970.222859

[1] ON THE COMPLEXITIES OF DEBRUIJN SEQUENCES [J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 1982, 33 (03) : 233 - 246

[2] Elspas B., 1959, IRE T CIRCUIT THEORY, V6, P45, DOI DOI 10.1109/TCT.1959.1086506

[3] ETZION T, UNPUB J COMBIN THE A

[4] A SURVEY OF FULL LENGTH NON-LINEAR SHIFT REGISTER CYCLE ALGORITHMS [J]. SIAM REVIEW, 1982, 24 (02) : 195 - 221

[5] A FAST ALGORITHM FOR DETERMINING THE COMPLEXITY OF A BINARY SEQUENCE WITH PERIOD 2N [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (01) : 144 - 146

[6] Golomb S., 1982, SHIFT REGISTER SEQUE

[7] Lempel A., 1970, IEEE Transactions on Computers, VC-19, P1204, DOI 10.1109/T-C.1970.222859