114 search results - page 8 / 23 » Hardness of Approximating the Minimum Distance of a Linear C... |
114
click to vote
COCO
2004
Springer
15 years 4 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...
113
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We study tolerant linearity testing under general distributions. Given groups G and H, a distribution µ on G, and oracle access to a function f : G → H, we consider th...
110
Voted
AAECC
2001
Springer
15 years 4 months ago
2001
Springer
A projective multiset is a collection of projective points, which are not necessarily distinct. A linear code can be represented as a projective multiset, by taking the columns of ...
125
click to vote
STOC
2009
ACM
16 years 29 days ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
100
click to vote
ISAAC
2003
Springer
15 years 5 months ago
2003
Springer
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...