54 search results - page 2 / 11 » Upper Bound on List-Decoding Radius of Binary Codes |
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We apply Schrijver's semidefinite programming method to obtain improved upper bounds on generalized distances and list decoding radii of binary codes.
TIT
2008
13 years 4 months ago
2008
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
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 ...
CORR
2010
Springer
13 years 5 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...