35 search results - page 7 / 7 » Subspace Polynomials and List Decoding of Reed-Solomon Codes |
DCC
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract. Given an algebraic geometry code CL(D, P), the GuruswamiSudan algorithm produces a list of all codewords in CL(D, P) within a specified distance of a received word. The i...
STOC
2009
ACM
14 years 8 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...
ICS
2010
Tsinghua U.
13 years 11 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...
FOCS
2000
IEEE
13 years 11 months ago
2000
IEEE
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
This paper provides the first explicit construction of extractors which are simultaneously optimal up to constant factors in both seed length and output length. More precisely, fo...