111 search results - page 1 / 23 » The Complexity of Local List Decoding |
APPROX
2008
Springer
14 years 1 months ago
2008
Springer
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...
ECCC
2010
13 years 6 months ago
2010
Trevisan [Tre03] suggested a transformation that allows amplifying the error rate a code can handle. We observe that this transformation, that was suggested in the non-local setti...
DAM
2006
13 years 11 months ago
2006
We consider bounded distance list decoding, such that the decoder calculates the list of all codewords within a sphere around the received vector. We analyze the performance and t...
TIT
2008
13 years 11 months ago
2008
Let a biorthogonal Reed
ECCC
2010
13 years 6 months ago
2010
Efremenko showed locally-decodable codes of sub-exponential length that can handle close to 1 6 fraction of errors. In this paper we show that the same codes can be locally unique...