151 search results - page 4 / 31 » A Lower Bound on List Size for List Decoding |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen’s inequality as well as some other inequa...
APPROX
2007
Springer
14 years 1 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...
ESA
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We show that all algebraic-geometric codes possess a succinct representation that allows for the list decoding algorithms of [15, 7] to run in polynomial time. We do this...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A (n,d,e), the smallest for which every binary error-correcting code of length n and minimum distance d is decodable with a list of size up to radius e, is determined for all d 2e...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
— We demonstrate a decoding scheme for nested lattice codes which is able to decode a list of a particular size which contains the transmitted codeword with high probability. Thi...