On the Complexity of Multicovering Radii

DOI10.1109/TIT.2004.831850MaRDI QIDQ3547391zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The complexity of computing the covering radius of a code
• On covering problems of codes
• The multicovering radius problem for some types of discrete structures
• The multicovering radii of codes
• The complexity of the covering radius problem

Cited in

(7)

• Multicovering bounds from relative covering radii
• The complexity of computing the covering radius of a code
• Algorithms and Data Structures
• On the Lattice Isomorphism Problem
• On covering problems of codes
• The complexity of the covering radius problem
• On covering problems of Rado

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)