17 search results - page 2 / 4 » List Decodability at Small Radii |
TIT
2002
14 years 9 months ago
2002
Abstract--Informally, an error-correcting code has "nice" listdecodability properties if every Hamming ball of "large" radius has a "small" number of ...
FOCS
2003
IEEE
15 years 3 months ago
2003
IEEE
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. ? We show that for every code, the rat...
FOCS
2003
IEEE
15 years 3 months ago
2003
IEEE
We introduce a unifying framework for proving that predicate P is hard-core for a one-way function f, and apply it to a broad family of functions and predicates, reproving old res...
134
click to vote
IACR
2011
13 years 9 months ago
2011
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...