Sciweavers

APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
14 years 5 months ago
A Lower Bound on List Size for List Decoding
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...
Venkatesan Guruswami, Salil P. Vadhan