43 search results - page 1 / 9 » The Complexity of the Covering Radius Problem on Lattices an... |
COCO
2004
Springer
13 years 8 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
COCO
2006
Springer
13 years 8 months ago
2006
Springer
We provide the first hardness result for the Covering Radius Problem on lattices (CRP). Namely, we show that for any large enough p there exists a constant cp > 1 such that C...
DCG
2007
13 years 4 months ago
2007
DCC
2002
IEEE
13 years 4 months ago
2002
IEEE
Asymptotically bounding the covering radius in terms of the dual distance is a well-studied problem. We will combine the polynomial approach with estimates of the distance distribu...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is...