期刊
DISCRETE MATHEMATICS
卷 279, 期 1-3, 页码 191-202出版社
ELSEVIER
DOI: 10.1016/S0012-365X(03)00269-3
关键词
block design; incidence matrix; supersaturated design; uniformly resolvable design; U-type design
类别
Combinatorial designs have long had substantial application in the statistical design of experiments, and in the theory of error-correcting codes. Applications in experimental and theoretical computer science, communications, cryptography and networking have also emerged in recent years. In this paper, we focus on a new application of combinatorial design theory in experimental design theory. E(f(NOD)) criterion is used as a measure of non-orthogonality of U-type designs, and a lower bound of E(f(NOD)) which can serve as a benchmark of design optimality is obtained. A U-type design is E(f(NOD))-optimal if its E(f(NOD)) value achieves the lower bound. In most cases, E(f(NOD))-optimal U-type designs are supersaturated. We show that a kind of E(f(NOD))-optimal designs are equivalent to uniformly resolvable designs. Based on this equivalence, several new infinite classes for the existence of E(f(NOD))-optimal designs are then obtained. (C) 2003 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据