Coverings and packings Page 389 9 Coverings and Packings WH Mills and RC Mullin 1
INTRODUCTION 2 COVERING BOUNDS 3 COVERINGS FOR k AND t FIXED 4 COVERING …

The performance of traditional RAID Level 5 arrays is, for many applications, unacceptably
poor while one of its constituent disks is non-functional. This paper describes and evaluates …

Abstract A (v, k, t) covering design, or covering, is a family of k‐subnets, called blocks,
chosen from av‐set, such that each t‐subnet is contained in at least one of the blocks. The …

There exists a wide variety of applications in which data availability must be continuous, that
is, where the system is never taken off-line and any interruption in the accessibility of stored …

We explore completely regular subsets in distance-regular graphs. We make an attempt to
develop the general combinatorial and algebraic theory of these objects and also to delve …

New Designs Page 1 New Designs Iliya Bluskov Department of Mathematics and Statistics
University of Victoria, POBox 3045 Victoria, British Columbia V8W 3P4 CANADA June 2, 1995 …

We introduce an algorithm for the construction of a complete system of representatives of t‐
designs with given parameters t−(v, k, λ) and prescribed full automorphism group A. It is …

We describe a computer search for the construction of simple designs with prescribed
automorphism groups. Using our program package DISCRETA this search yields designs …

A large set of disjoint S (λ; t, k, v) designs, denoted by LS (λ; t, k, v), is a partition of k-subsets
of v-set into S (λ; t, k, v) designs. In this paper, we develop some recursive methods to …

1. X is a set of v elements (called points). 2. A is a family of b subsets of X, each of cardinality
k (called blocks). 3. Every point occurs in exactly r blocks. 4. Every pair of distinct points …