Density of normal binary covering codes

Robert B. Ellis

A binary code with covering radius $R$ is a subset $C$ of the hypercube $Q_n=\{0,1{\}}^n$ such that every $x\in Q_n$ is within Hamming distance $R$ of some codeword $c\in C$, where $…