MAXIMAL FAMILIES OF BENT SEQUENCES

被引：34

作者：

LEMPEL, A ^{[1
]}

COHN, M ^{[1
]}

机构：

[1] SPERRY RES CTR,SUDBURY,MA 01776

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1982年 / 28卷 / 06期

关键词：

D O I：

10.1109/TIT.1982.1056590

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：865 / 868

页数：4

共 11 条

[1] FAST M-SEQUENCE TRANSFORMS [J].

COHN, M ;

LEMPEL, A .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1977, 23 (01) :135-137

[2]

Dillon J. F., 1974, THESIS U MARYLAND

[3]

GOLD R, 1966, J SOC IND APPL MATH, V14, P980

[4]

Harwit M., 1979, HADAMARD TRANSFORM O

[5] COMMENT ON COMPUTATION OF FAST WALSH-FOURIER TRANSFORM [J].

HENDERSON, KW .

IEEE TRANSACTIONS ON COMPUTERS, 1970, C 19 (09) :850-+

[6] HADAMARD AND M-SEQUENCE TRANSFORMS ARE PERMUTATIONALLY SIMILAR [J].

LEMPEL, A .

APPLIED OPTICS, 1979, 18 (24) :4064-4065

[7]

Lempel A., 1975, SIAM Journal on Computing, V4, P175, DOI 10.1137/0204014

[8]

MCFARLAND RL, 1976, J COMBINATORIAL TH A, V20, P300

[9] BENT-FUNCTION SEQUENCES [J].

OLSEN, JD ;

SCHOLTZ, RA ;

WELCH, LR .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1982, 28 (06) :858-864

[10] BENT FUNCTIONS [J].

ROTHAUS, OS .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1976, 20 (03) :300-305

← 1 2 →