Sciweavers

APPROX
2008
Springer
190views Algorithms» more  APPROX 2008»
13 years 5 months ago
The Complexity of Local List Decoding
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
Dan Gutfreund, Guy N. Rothblum