List Decodability at Small Radii

Abstract

$A^{\prime }(n,d,e)$, the smallest $\ell$ for which every binary error-correcting code of length $n$ and minimum distance $d$ is decodable with a list of size $\ell$ up to radius $e$, is determined for all $d\ge 2e-3$. As a result, $A^{\prime }(n,d,e)$ is determined for all $e\le 4$, except for 42 values of $n$.

to appear in Designs, Codes, and Cryptography (accepted October 2010)