In information theory, the Hamming distance between two strings of equal length is the number of positions at which the corresponding symbols are different. Put another way, it measures the minimum number of substitutions required to change one string into the other, or the number of errors that transformed one string into the other.
Read more about Hamming Distance: Examples, Special Properties, History and Applications, Algorithm Example
Famous quotes containing the word distance:
“Small, black, as flies hanging in heat, the Boys,
Until the distance throws them forth, their hum
Bulges to thunder held by calf and thigh.”
—Thom Gunn (b. 1929)