2000 character limit reached
List Decodability at Small Radii (1010.3312v1)
Published 16 Oct 2010 in cs.IT, cs.DM, math.CO, and math.IT
Abstract: $A'(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\geq 2e-3$. As a result, $A'(n,d,e)$ is determined for all $e\leq 4$, except for 42 values of $n$.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.