8 search results - page 1 / 2 » An Improved Bound on the List Error Probability and List Dis... |
TIT
2008
13 years 4 months ago
2008
A new upper bound on the list error probability is presented. This bound is derived by combining the techniques for obtaining the tangential union bound with an improved bound on t...
CORR
2007
Springer
13 years 5 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...
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...
DCC
2010
IEEE
13 years 7 days ago
2010
IEEE
Abstract. Given an algebraic geometry code CL(D, P), the GuruswamiSudan algorithm produces a list of all codewords in CL(D, P) within a specified distance of a received word. The i...
TIT
2008
13 years 5 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...