## Covering radius - Survey and recent results

- Gérard D. Cohen, Mark G. Karpovsky, Harold F. Mattson, James R. Schatz
- IEEE Trans. Information Theory
- 1985

@article{Francs2007OnCP, title={On covering problems of codes}, author={Mar{\'i}a del Mar Franc{\'e}s and Ami Litman}, journal={Theory of Computing Systems}, year={2007}, volume={30}, pages={113-119} }

- Published 2007 in Theory of Computing Systems
DOI:10.1007/BF02679443

LetC be a binary code of lengthn (i.e., a subset of {0, 1} n ). TheCovering Radius of C is the smallest integerr such that each vector in {0, 1} n is at a distance at mostr from some code word. Our main result is that the decision problem associated with the Covering Radius of arbitrary binary codes is NP-complete. This result is established as follows. TheRadius of a binary codeC is the smallest integerr such thatC is contained in a radius-r ball of the Hamming metric space 〈{0, 1} n ,d〉. It… CONTINUE READING

Showing 1-5 of 5 references