Hamming distance
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
Also named here as sphere packing bound — the same set of essays touches all of them, so they are one junction rather than several.
Distance is a picture
A message is a corner of a cube and an error is a step along an edge. Everything a code can do is decided by how far apart the corners it uses are — and that is a fact about a drawing.
Sixteen spheres that fill a cube
A hundred and twenty-eight seven-bit words, sixteen of them chosen, and a ball of eight around each. Sixteen times eight is a hundred and twenty-eight exactly — so the balls tile the space with nothing left over, and the code wastes nothing at all.
Named alongside it
The objects these essays reach for when they reach for this one.
Error correcting codeMinimum distanceSphere packing boundCheck digitCode rateCosetCounting argumentHamming codeHypercubeMetricModular arithmeticParity