Back to Search
Start Over
Combinatorial constructions for optimal supersaturated designs
- Source :
-
Discrete Mathematics . Mar2004, Vol. 279 Issue 1-3, p191. 12p. - Publication Year :
- 2004
-
Abstract
- 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. <f>E(fNOD)</f> criterion is used as a measure of non-orthogonality of U-type designs, and a lower bound of <f>E(fNOD)</f> which can serve as a benchmark of design optimality is obtained. A U-type design is <f>E(fNOD)</f>-optimal if its <f>E(fNOD)</f> value achieves the lower bound. In most cases, <f>E(fNOD)</f>-optimal U-type designs are supersaturated. We show that a kind of <f>E(fNOD)</f>-optimal designs are equivalent to uniformly resolvable designs. Based on this equivalence, several new infinite classes for the existence of <f>E(fNOD)</f>-optimal designs are then obtained. [Copyright &y& Elsevier]
- Subjects :
- *BLOCK designs
*EXPERIMENTAL design
*ORTHOGONAL functions
*CRYPTOGRAPHY
Subjects
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 279
- Issue :
- 1-3
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 12379123
- Full Text :
- https://doi.org/10.1016/S0012-365X(03)00269-3