114 search results - page 20 / 23 » Hardness of Approximating the Minimum Distance of a Linear C... |
111
Voted
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract. We present a Fourier-analytic approach to list-decoding Reed-Muller codes over arbitrary finite fields. We use this to show that quadratic forms over any field are locall...
129
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
110
click to vote
FOCS
2004
IEEE
15 years 4 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
122
click to vote
PODS
2004
ACM
16 years 14 days ago
2004
ACM
Geometric coordinates are an integral part of many data streams. Examples include sensor locations in environmental monitoring, vehicle locations in traffic monitoring or battlefi...
112
Voted
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...