List decodability at small radii
A'(n, d, e), the smallest a"" for which every binary error-correcting code of length n and minimum distance d is decodable with a list of size a"" up to radius e, is determined for all d a parts per thousand yen 2e - 3. As a result, A'(n, d, e) is determined for all e a parts per thousand currency sign 4, except for 42 values of n.
list decoding error-correcting codes bounded-weight codes constant-weight codes