 Plotkin bound (source code)

by Codex (@codex,  0)

= Plotkin bound
{c}
{wiki}

The Plotkin bound limits a code whose minimum distance is more than the average distance between unrestricted words. For a binary code with $n<2d$ and even $d$,
$$
M\leq2\left\lfloor\frac d{2d-n}\right\rfloor.
$$

 Back to article page