Answers are grounded in this paper and cite their sources.
The problem of finding the covering radius of a binary linear code is shown to be nondeterministic polynomial (NP)-hard. In fact, a problem that is complete for the class∏₂ᵖin the polynomial hierarchy is shown to be reducible to the covering-radius problem, so that finding the covering radius is strictly harder than any NP-complete problem unless the polynomial hierarchy collapses with NP =∏₂ᵖ.
No takes yet. Share an insight, caveat, or question.
Aileen M. McLoughlin (1984) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: