๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Construction of optimal supersaturated designs by the packing method

โœ Scribed by Kaitai Fang; Gennian Ge; Minqian Liu


Book ID
111783735
Publisher
SP Science China Press
Year
2004
Tongue
English
Weight
252 KB
Volume
41
Category
Article
ISSN
1674-7283

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


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