17 search results - page 1 / 4 » List Decodability at Small Radii |
CORR
2010
Springer
13 years 6 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 apply Schrijver's semidefinite programming method to obtain improved upper bounds on generalized distances and list decoding radii of binary codes.
CATS
2007
13 years 7 months ago
2007
d Abstract) Tomoyuki Yamakami Department of Computer Software, University of Aizu 90 Kami-Iawase, Tsuruga, Ikki-machi, Fukushima 965-8580, Japan Our task of quantum list decoding ...
APPROX
2005
Springer
13 years 11 months ago
2005
Springer
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...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...