OurBigBook.comSite Source code

Hamming bound

A binary length-

n

code of size

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.

 Ancestors (5)

 Incoming links (2)