𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Combinatorial constructions for optimal supersaturated designs

✍ Scribed by Kai-Tai Fang; Gennian Ge; Min-Qian Liu; Hong Qin

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
241 KB
Volume
279
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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(fNOD) criterion is used as a measure of non-orthogonality of U-type designs, and a lower bound of E(fNOD) which can serve as a benchmark of design optimality is obtained. A U-type design is E(fNOD)-optimal if its E(fNOD) value achieves the lower bound. In most cases, E(fNOD)-optimal U-type designs are supersaturated. We show that a kind of E(fNOD)-optimal designs are equivalent to uniformly resolvable designs. Based on this equivalence, several new inΓΏnite classes for the existence of E(fNOD)-optimal designs are then obtained.

πŸ“œ SIMILAR VOLUMES

Constructions of optimal packing designs
Constructions of optimal packing designs
✍ Jianxing Yin; Ahmed M. Assaf πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 195 KB πŸ‘ 1 views

Let v and k be positive integers. A (v, k, 1)-packing design is an ordered pair (V, B B B) where V is a v-set and B B B is a collection of k-subsets of V (called blocks) such that every 2-subset of V occurs in at most one block of B B B. The packing problem is mainly to determine the packing number

New constructions for covering designs
New constructions for covering designs
✍ Daniel M. Gordon; Oren Patashnik; Greg Kuperberg πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 838 KB

A (v, k, t) covering design, or covering, is a family of k-subsets, called blocks, chosen from a wet, such that each t-subset is contained in at least one of the blocks. The number of blocks is the covering's size, and the minimum size of such a covering is denoted by C(v, k, t). This paper gives th

New constructions for perfect hash famil
New constructions for perfect hash families and related structures using combinatorial designs and codes
✍ D. R. Stinson; R. Wei; L. Zhu πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 141 KB πŸ‘ 1 views

In this paper, we consider explicit constructions of perfect hash families using combinatorial methods. We provide several direct constructions from combinatorial structures related to orthogonal arrays. We also simplify and generalize a recursive construction due to Atici, Magliversas, Stinson and