General upper bounds on the minimum size of covering designs
type: Item
instance of: scholarly article
title: General upper bounds on the minimum size of covering designs
zbMATH Open document ID: 0919.05013
author: Iliya Bluskov
author: Katherine Heinrich
published in: Journal of Combinatorial Theory. Series A
publication date: 1999-07-20T00:00:00Z
review text: A collection of \(k\)-element subsets (called blocks) out of a \(v\)-set such that each \(t\)-subset of the \(v\)-set is contained in at least one block is called a \((v,k,t)\) covering design. The minimum size of a \((v,k,t)\) covering design is denoted by \(C(v,k,t)\). The authors present several constructions that give infinite families of good covering designs, which lead to new upper bounds on \(C(v,k,t)\). These constructions act on covering designs that can be partitioned into covering designs with other parameters (among others, resolvable designs are used), and on \(t\)-wise balanced designs.
reviewed by: Patric R. J. Östergård
Mathematics Subject Classification ID: 05B40
Mathematics Subject Classification ID: 05B05
zbMATH DE Number: 1295465
zbMATH Keywords: covering design
zbMATH Keywords: covering number
zbMATH Keywords: constant weight covering code
MaRDI profile type: Publication
OpenAlex ID: W1995577489
cites work: Q4096959
cites work: Q3737429
cites work: New upper bounds on the minimum size of covering designs
cites work: Large sets of coverings
cites work: Bounds on the sizes of constant weight covering codes
cites work: New constructions for covering designs
cites work: Q4026151
cites work: Q4304396
cites work: Weight and distance structure of Nordstrom-Robinson quadratic code
cites work: On coverings
cites work: Q4168865
cites work: Q4063038
DOI: 10.1006/JCTA.1998.2927
Recommended article: New upper bounds on the minimum size of covering designs
Recommended article: Asymptotic Bounds for General Covering Designs
Recommended article: On the optimality of a class of minimal covering designs
Recommended article: Optimal covering designs: complexity results and new bounds
Recommended article: Generalized covering designs and clique coverings
Recommended article: Some constructions of general covering designs
Recommended article: Q4502642
Recommended article: Asymptotically optimal covering designs
description: scientific article; zbMATH DE number 1295465