NEED OF T-DESIGNS IN SAMPLING THEORY

被引：0

|

作者：

SRIVASTAVA, J ^{[1
]}

SALEH, F ^{[1
]}

机构：

[1] COLORADO STATE UNIV,DEPT STAT,FT COLLINS,CO 80523

来源：

UTILITAS MATHEMATICA | 1985年 / 28卷

关键词：

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

收藏

页码：5 / 17

页数：13

相关论文

共 50 条

[1] THEORY OF EXTENSION OF T-DESIGNS
DEHON, M
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1976, 21 (01) : 93 - 99
[2] New t-designs and large sets of t-designs
Betten, A
Laue, R
Wassermann, A
DISCRETE MATHEMATICS, 1999, 197 (1-3) : 111 - 121
[3] Constructions for t-designs and s-resolvable t-designs
Trung, Tran van
DESIGNS CODES AND CRYPTOGRAPHY, 2024, 92 (11) : 3503 - 3514
[4] LOCALLY TRIVIAL T-DESIGNS AND T-DESIGNS WITHOUT REPEATED BLOCKS
TEIRLINCK, L
DISCRETE MATHEMATICS, 1989, 77 (1-3) : 345 - 356
[5] On t-designs and s-resolvable t-designs from hyperovals
Tran Van Trung
JOURNAL OF COMBINATORIAL DESIGNS, 2020, 28 (03) : 261 - 270
[6] COMBINING T-DESIGNS
KHOSROVSHAHI, GB
AJOODANINAMINI, S
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1991, 58 (01) : 26 - 34
[7] Resolvable t-Designs
Reinhard Laue
Designs, Codes and Cryptography, 2004, 32 : 277 - 301
[8] A generalisation of t-designs
Cameron, Peter J.
DISCRETE MATHEMATICS, 2009, 309 (14) : 4835 - 4842
[9] INEQUALITIES FOR T-DESIGNS
WILSON, RM
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1983, 34 (03) : 313 - 324
[10] Resolvable t-designs
Laue, R
DESIGNS CODES AND CRYPTOGRAPHY, 2004, 32 (1-3) : 277 - 301

← 1 2 3 4 5 →