1184 search results - page 3 / 237 » Algorithmic Results in List Decoding |
APPROX
2008
Springer
15 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...
94
Voted
TIT
2008
14 years 11 months ago
2008
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
107
click to vote
ICS
2010
Tsinghua U.
15 years 3 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...
STOC
2000
ACM
15 years 3 months ago
2000
ACM
We give efficient (polynomial-time) list-decoding algorithms for certain families of errorcorrecting codes obtained by "concatenation". Specifically, we give list-decodi...
ASIACRYPT
2001
Springer
15 years 3 months ago
2001
Springer
Abstract. We use powerful new techniques for list decoding errorcorrecting codes to efficiently trace traitors. Although much work has focused on constructing traceability schemes,...