General upper bounds on the minimum size of covering designs
From MaRDI portal
Publication:1291117
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
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
Combinatorial aspects of block designs (05B05) Combinatorial aspects of packing and covering (05B40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On coverings
- New upper bounds on the minimum size of covering designs
- Title not available (Why is that?)
- Bounds on the sizes of constant weight covering codes
- Title not available (Why is that?)
- New constructions for covering designs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Weight and distance structure of Nordstrom-Robinson quadratic code
- Large sets of coverings
Cited In (9)
- Title not available (Why is that?)
- Optimal covering designs: complexity results and new bounds
- An improvement on covering triples by quadruples
- Some constructions of general covering designs
- Generalized covering designs and clique coverings
- New upper bounds on the minimum size of covering designs
- The covering radius of permutation designs
- Infinite Classes of Covering Numbers
- Some \(t\)-designs are minimal \((t+1)\)-coverings
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)