General upper bounds on the minimum size of covering designs

DOI10.1006/JCTA.1998.2927zbMATH Open0919.05013OpenAlexW1995577489MaRDI QIDQ1291117FDOQ1291117

Authors Iliya Bluskov, Katherine Heinrich 

Publication date 20 July 1999

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/5fc0f94019d30c43189d223405f219511dcd6db5

zbMATH Keywords

covering numbercovering designconstant weight covering code

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of packing and covering (05B40)

Recommendations

• New upper bounds on the minimum size of covering designs
• Asymptotic bounds for general covering designs
• On the optimality of a class of minimal covering designs
• Optimal covering designs: complexity results and new bounds
• Generalized covering designs and clique coverings
• Some constructions of general covering designs
• scientific article; zbMATH DE number 1504678
• Asymptotically optimal covering designs

Cites work

• scientific article; zbMATH DE number 3970750 (Why is no real title available?)
• scientific article; zbMATH DE number 124521 (Why is no real title available?)
• scientific article; zbMATH DE number 3480474 (Why is no real title available?)
• scientific article; zbMATH DE number 3518823 (Why is no real title available?)
• scientific article; zbMATH DE number 3601524 (Why is no real title available?)
• scientific article; zbMATH DE number 637340 (Why is no real title available?)
• Bounds on the sizes of constant weight covering codes
• Large sets of coverings
• New constructions for covering designs
• New upper bounds on the minimum size of covering designs
• On coverings
• Weight and distance structure of Nordstrom-Robinson quadratic code

Cited in

(11)

• scientific article; zbMATH DE number 1504678 (Why is no real title available?)
• Some \(t\)-designs are minimal \((t+1)\)-coverings
• Optimal covering designs: complexity results and new bounds
• New constructions for covering designs
• Generalized covering designs and clique coverings
• An improvement on covering triples by quadruples
• Infinite Classes of Covering Numbers
• Asymptotically optimal covering designs
• New upper bounds on the minimum size of covering designs
• The covering radius of permutation designs
• Some constructions of general covering designs

This page was built for publication: General upper bounds on the minimum size of covering designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291117)