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:
“The mystery of the evening-star brilliant in silence and distance between the downward-surging plunge of the sun and the vast, hollow seething of inpouring night. The magnificence of the watchful morning-star, that watches between the night and the day, the gleaming clue to the two opposites.”
—D.H. (David Herbert)