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

New Constructions of BIB Designs

โœ Scribed by Dr. S. Kageyama; Dr. R. N. Mohan


Publisher
John Wiley and Sons
Year
1985
Tongue
English
Weight
186 KB
Volume
27
Category
Article
ISSN
0323-3847

No coin nor oath required. For personal study only.

โœฆ Synopsis


A method of construction of certain balanced incomplete block (BIB) designs is defined from which we get new series of BIB designs.

1 . Introduction

For a BIB design with parameters v, b, r , k, I if the blocks can be separated into t


๐Ÿ“œ 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

Construction of Lattice Square Designs
โœ Prof. W. T. Federer; J. Wright ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 368 KB

## KHARE and FEDERER (1981) presented a simple method for constructing incomplete block designs for any number of treatments. Their procedure is extended to constructing lattice square designs. Using variety cutting, lattice square designs are available for any number of treatments.

New constructions for perfect hash famil
โœ D. R. Stinson; R. Wei; L. Zhu ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 141 KB

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