Hamming bound
= Hamming bound
{c}
{wiki}
A binary length-$n$ code of size $M$ and distance at least $2t+1$ satisfies
$$
M\sum_{j=0}^t\binom nj\le2^n.
$$
Equality means the code is perfect.
= Hamming bound
{c}
{wiki}
A binary length-$n$ code of size $M$ and distance at least $2t+1$ satisfies
$$
M\sum_{j=0}^t\binom nj\le2^n.
$$
Equality means the code is perfect.