LINEAR SPANS OF MODIFIED DEBRUIJN SEQUENCES

被引：19

作者：

MAYHEW, GL ^{[1
]}

GOLOMB, SW ^{[1
]}

机构：

[1] UNIV SO CALIF,LOS ANGELES,CA 90089

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1990年 / 36卷 / 05期

关键词：

D O I：

10.1109/18.57220

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Order n modified de Bruijn sequences are created by removing a single zero from the longest run of zeros in period 2n de Bruijn sequences. The M sequences are then the natural undisguised linear subset of modified de Bruijn sequences. Theorems are given on the linear spans of modified de Bruijn sequences and data presented for 4 ≥ n ≥ 6. © 1990 IEEE

引用

页码：1166 / 1167

页数：2

共 8 条

[1] ON THE COMPLEXITIES OF DEBRUIJN SEQUENCES
CHAN, AH
GAMES, RA
KEY, EL
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 1982, 33 (03) : 233 - 246
[2] De Bruijn N. G., 1946, P KONINKLIJKE NEDERL, V49, P758
[3] A SURVEY OF FULL LENGTH NON-LINEAR SHIFT REGISTER CYCLE ALGORITHMS
FREDRICKSEN, H
[J]. SIAM REVIEW, 1982, 24 (02) : 195 - 221
[4] Golomb S., 1982, SHIFT REGISTER SEQUE
[5] MASSEY JL, 1969, IEEE T INFORM THEORY, V15, P122, DOI 10.1109/TIT.1969.1054260
[6] MAYHEW GL, 1987, THESIS U SO CALIFORN
[7] Niven I., 1980, THEORY NUMBERS, V4th
[8] CONTINUED FRACTIONS AND BERLEKAMPS ALGORITHM
WELCH, LR
SCHOLTZ, RA
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (01) : 19 - 27

← 1 →