Multicovering bounds from relative covering radii

DOI10.1137/S089548010037935XzbMATH Open1006.94031OpenAlexW2080081556MaRDI QIDQ2784513

Andrew Klapper, Iiro Honkala

Publication date: 23 April 2002

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s089548010037935x

zbMATH Keywords

covering radiusmulticovering radiicoding theoryHamming codesmulticovering radius

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Combinatorial aspects of packing and covering (05B40)

Related Items (3)

New lower bounds for multiple coverings ⋮ Algorithms and Data Structures ⋮ Title not available (Why is that?)

Recommendations

• On the multi-radius cover problem 👍 👎
• Bounds for optimal coverings 👍 👎
• On covering bounded sets by collections of circles of various radii 👍 👎
• New lower bounds for multiple coverings 👍 👎
• Bounds for optimal coverings 👍 👎
• A nonconstructive upper bound on covering radius 👍 👎
• An Upper Bound on Covering Radius 👍 👎
• On the Complexity of Multicovering Radii 👍 👎
• Covering radius---Survey and recent results 👍 👎
• The covering radius of a mapping and the multiplicity of a covering 👍 👎

This page was built for publication: Multicovering bounds from relative covering radii

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