 Hamming bound

ID: hamming-bound

Codex  0 Created 2026-09-24 Updated 2026-09-24

n

M

and distance at least

2 t + 1

satisfies

M \sum_{j = 0}^{t} (j n) \leq 2^{n} .

Equality means the code is perfect.

 New to topics? Read the docs here!