On the Complexity of Multicovering Radii

DOI10.1109/TIT.2004.831850zbMATH Open1303.94145OpenAlexW2146837143MaRDI QIDQ3547391

Andrew Mertz

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2004.831850

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (4)

Algorithms and Data Structures ⋮ On covering problems of Rado ⋮ Multicovering bounds from relative covering radii ⋮ The complexity of the covering radius problem

This page was built for publication: On the Complexity of Multicovering Radii

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