✦ LIBER ✦

On some covering designs

✍ Scribed by D.T Todorov

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 905 KB
Volume: 39
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(85)90084-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Random Covering Designs

✍ Anant P. Godbole; Svante Janson 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 559 KB

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

Asymptotically Optimal Covering Designs

✍ Daniel M. Gordon; Oren Patashnik; Greg Kuperberg; Joel H. Spencer 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 241 KB

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

Generalized covering designs and clique

Generalized covering designs and clique coverings

✍ Robert F. Bailey; Andrea C. Burgess; Michael S. Cavers; Karen Meagher 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB

Inspired by the "generalized t-designs" defined by Cameron [P. J. Cameron, Discrete Math 309 (2009), 4835-4842], we define a new class of combinatorial designs which simultaneously provide a generalization of both covering designs and covering arrays. We then obtain a number of bounds on the minimu

On some spherical t-designs

✍ Eiichi Bannai 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 279 KB

Some remarks on permutation designs

✍ W Braun; H de Graaff 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 133 KB