NONUNIFORM LINEAR ARRAYS - GRAPH-THEORETIC APPROACH TO MINIMUM REDUNDANCY

被引：14

作者：

BEDROSIAN, SD

机构：

来源：

PROCEEDINGS OF THE IEEE | 1986年 / 74卷 / 07期

关键词：

D O I：

10.1109/PROC.1986.13581

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

引用

页码：1040 / 1043

页数：4

共 14 条

[1] TREE COUNTING POLYNOMIALS FOR LABELED GRAPHS .1. PROPERTIES [J].

BEDROSIAN, SD .

JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1981, 312 (06) :417-430

[2] THE ENUMERATION OF IRREDUCIBLE COMBINATORIAL OBJECTS [J].

BEISSINGER, JS .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1985, 38 (02) :143-169

[3] STANFORD 5 ELEMENT RADIO TELESCOPE [J].

BRACEWELL, RN ;

COLVIN, RS ;

DADDARIO, LR ;

GREBENKEMPER, CJ ;

PRICE, KM ;

THOMPSON, AR .

PROCEEDINGS OF THE IEEE, 1973, 61 (09) :1249-1257

[4]

HANSEN RC, 1983, HDB ANTENNA DESIGN, V2, pCH9

[5] MINIMUM REDUNDANCY LINEAR ARRAYS FOR A LARGE NUMBER OF ANTENNAS [J].

ISHIGURO, M .

RADIO SCIENCE, 1980, 15 (06) :1163-1170

[6] ALMOST-PERIODIC LINEAR ARRAYS [J].

JAGGARD, DL ;

FARINA, DJ .

PROCEEDINGS OF THE IEEE, 1983, 71 (03) :436-437

[7]

Klemperer W. K., 1973, IEEE C PUBL, V105, P74

[8] MUST HARD PROBLEMS BE HARD [J].

KOLATA, G .

SCIENCE, 1985, 228 (4698) :479-481

[9]

Leech J., 1956, J LOND MATH SOC, V1, P160

[10]

LEEPER DG, 1977, THESIS U PENNSYLVANI

← 1 2 →