Asymptotically Optimal Covering Designs
β Scribed by Daniel M. Gordon; Oren Patashnik; Greg Kuperberg; Joel H. Spencer
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 241 KB
- Volume
- 75
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A t&(n, k, \*) covering design (n k>t 2) consists of a collection of k-element subsets (blocks) of an n-element set X such that each t-element subset of X occurs in at least \* blocks. Let \*=1 and k 2t&1. Consider a randomly selected collection B of blocks; |B| =,(n). We use the correlation inequal
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
## Abstract An inspection model in life testing situations is discussed. The system under study is assumed to consist on __n__ independent components all of which fail independently in an exponential fashion. Failures can be discovered only through inspection. The experimenter is assumed to lack th