Complexity Explorer Santa Fe Institute


Hamming distance

In information theory, the Hamming distance between two strings of equal length is the number of positions at which the corresponding symbols are different. In another way, it measures the minimum number of substitutions required to change one string into the other, or the minimum number of errors that could have transformed one string into the other.

The Hamming distance between:

"complex" and "simplex" is 2.
11011011 and 01101001 is 3.
112358 and 336915 is 6.


Topics
Information Theory, Entropy
Difficulty
1