CONSTRUCTION OF DEBRUIJN SEQUENCES OF MINIMAL COMPLEXITY

被引：29
作者：
ETZION, T
LEMPEL, A
机构：
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1984年 / 30卷 / 05期
关键词：
D O I：
10.1109/TIT.1984.1056965
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：705 / 709
页数：5
相关论文
共 7 条
[1]   ON THE COMPLEXITIES OF DEBRUIJN SEQUENCES [J].
CHAN, AH ;
GAMES, RA ;
KEY, EL .
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].
FREDRICKSEN, H .
SIAM REVIEW, 1982, 24 (02) :195-221
[5]   A FAST ALGORITHM FOR DETERMINING THE COMPLEXITY OF A BINARY SEQUENCE WITH PERIOD 2N [J].
GAMES, RA ;
CHAN, AH .
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