151 search results - page 3 / 31 » A Lower Bound on List Size for List Decoding |
STACS
2005
Springer
14 years 28 days ago
2005
Springer
We revisit the construction of high noise, almost optimal rate list decodable code of Guruswami [1]. Guruswami showed that if one can explicitly construct optimal extractors then o...
TIT
2008
13 years 7 months ago
2008
This paper derives an improved sphere-packing (ISP) bound for finite-length error-correcting codes whose transmission takes place over symmetric memoryless channels, and the codes...
TIT
2002
13 years 7 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 ...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
1-- list of accepted papers with abstracts 1— LIST OF ACCEPTED PAPERS WITH ABSTRACTS (By submitted order)
CORR
2008
Springer
13 years 7 months ago
2008
Springer
A generalization of the Reiger bound is presented for the list decoding of burst errors. It is then shown that Reed