NONEXISTENCE OF PERFECT BINARY ARRAYS

被引：5

作者：

JEDWAB, J

机构：

[1] Hewlett-Packard Laboratories, Bristol, Filton Road Stoke Gifford

来源：

ELECTRONICS LETTERS | 1991年 / 27卷 / 14期

关键词：

INFORMATION THEORY; MATHEMATICAL TECHNIQUES;

D O I：

10.1049/el:19910785

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

New nonexistence results are deduced for perfect binary arrays from theorems of Turyn on difference sets. It is shown that this rules out 17 undecided cases from the recent table of Chan and Siu for the two-dimensional case.

引用

页码：1252 / 1254

页数：3

共 7 条

[1]

Beth T, 1986, DESIGN THEORY

[2] SUMMARY OF PERFECT SXT ARRAYS, 1-LESS-THAN-OR-EQUAL-TO-S-LESS-THAN-OR-EQUAL-TO-T-LESS-THAN-OR-EQUAL-TO-100 [J].

CHAN, WK ;

SIU, MK .

ELECTRONICS LETTERS, 1991, 27 (09) :709-710

[3]

CHAN WK, 1991, ELECTRON LETT, V27, P1112, DOI 10.1049/el:19910692

[4]

Davis J.A., 1987, THESIS U VIRGINIA

[5] A NEW RESTRICTION ON THE LENGTHS OF GOLAY COMPLEMENTARY SEQUENCES [J].

ELIAHOU, S ;

KERVAIRE, M ;

SAFFARI, B .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1990, 55 (01) :49-59

[6] ON PERFECT BINARY ARRAYS [J].

KOPILOVICH, LE .

ELECTRONICS LETTERS, 1988, 24 (09) :566-567

[7]

Lander E. S., 1983, LONDON MATH SOC LECT, V74

← 1 →