ON THE COMPLEXITIES OF DEBRUIJN SEQUENCES

被引：83

作者：

CHAN, AH ^{[1
]}

GAMES, RA ^{[1
]}

KEY, EL ^{[1
]}

机构：

[1] NORTHEASTERN UNIV,DEPT MATH,BOSTON,MA 02115

来源：

关键词：

D O I：

10.1016/0097-3165(82)90038-3

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：233 / 246

页数：14

共 13 条

[1]

de Bruijn N.-C., 1946, K NED AKAD WET, V49, P758

[2]

GAMES RA, 1982, UNPUB IEEE T INFORM

[3]

Golomb S.W., 1967, SHIFT REGISTER SEQUE

[4]

GOOD IJ, 1947, J LOND MATH SOC, V21, P167

KEY, EL .

[6] 3 APPROACHES TO QUANTITATIVE DEFINITION OF INFORMATION [J].

KOLMOGOROV, AN .

[7] COMPLEXITY OF FINITE SEQUENCES [J].

LEMPEL, A ;

ZIV, J .

[8]

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

[9] DEFINITION OF RANDOM SEQUENCES [J].

MARTINLOF, P .

INFORMATION AND CONTROL, 1966, 9 (06) :602-+

[10]

MASSEY JL, 1969, IEEE T INFORM THEORY, V15, P122, DOI 10.1109/TIT.1969.1054260