Error Correction

If the covering radius of a code is $r$, then for every vector $v$, there is a codeword with distance at most $r$ from $v$. One can bound the covering radius by the distance of the *dual* code from [t...