111 search results - page 3 / 23 » The Complexity of Local List Decoding |
89
Voted
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...
83
Voted
JSAC
2010
14 years 5 months ago
2010
In this paper, we present a generalization of the ordered statistics decoding (OSD) techniques for the class of intersymbol interference (ISI) channels, and show decoding results f...
97
Voted
ICS
2010
Tsinghua U.
15 years 2 months ago
2010
Tsinghua U.
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...
76
Voted
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...
VTC
2006
IEEE
15 years 4 months ago
2006
IEEE
The interest in near-ML detection algorithms for Multiple-Input/lMultiple-Output (MIMO) systems have always been high due to their drastic performance gain over suboptimal algorith...