On the size of partial block designs with large blocks Original Research Article

A image design is a k-uniform hypergraph with the property that every set of t vertices is contained in exactly image of the edges (blocks). A partial image design is a k-uniform hypergraph with the property that every set of t vertices is contained in at most image edges; or equivalently the intersection of every set of image blocks contains fewer than t elements. Let us denote by image the maximum size of a partial image design. We determine image as a fundamental problem in design theory and in coding theory. In this paper we provide some new bounds for image.