Concept

Sphere-packing bound

The limit on how many codewords a code can hold, being the number of words divided by the size of one correction ball. A code meeting it exactly is called perfect, and the Hamming codes are the standard family that does.

Named by 2 essays across one field — each of them below, with the objects they name alongside it.

Named alongside it

The objects these essays reach for when they reach for this one.

Error-correcting codeHamming distanceMinimum distanceCheck digitCode rateCosetCounting argumentHamming codeHypercubeMetricModular arithmeticParity

All concepts