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:
“It is painful to recall a past intensity, to estimate your distance from the Belsen heap, to make your peace with numbers. Just to get up each morning is to make a kind of peace.”
—Leonard Cohen (b. 1934)