43 search results - page 1 / 9 » Combinatorial bounds for list decoding |
TIT
2002
13 years 4 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 ...
STOC
2009
ACM
14 years 5 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...
STOC
2000
ACM
13 years 8 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...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
In this paper, we prove the following two results that expose some combinatorial limitations to list decoding ReedSolomon codes.
APPROX
2005
Springer
13 years 10 months ago
2005
Springer
A q-ary error-correcting code C ⊆ {1, 2, . . . , q}n is said to be list decodable to radius ρ with list size L if every Hamming ball of radius ρ contains at most L codewords o...