9 search results - page 1 / 2 » The existence of concatenated codes list-decodable up to the... |
TIT
2010
12 years 11 months ago
2010
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
APPROX
2007
Springer
13 years 10 months ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
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...
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
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...