General upper bounds on the minimum size of covering designs

DOI10.1006/jcta.1998.2927zbMath0919.05013OpenAlexW1995577489MaRDI QIDQ1291117

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)

Cites Work

• Bounds on the sizes of constant weight covering codes
• On coverings
• New upper bounds on the minimum size of covering designs
• New constructions for covering designs
• Large sets of coverings
• Weight and distance structure of Nordstrom-Robinson quadratic code
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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