You are here: irt.org | FOLDOC | Hamming distance
<data> The minimum number of bits that must be changed in order to convert one bit string into another.
Named after the mathematician Richard Hamming.
[Connection with Hamming code?].
(2002-07-02)
Nearby terms: Hamilton's problem « hammer « Hamming code « Hamming distance » Hamming, Richard » hamster » Han character
FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL