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:
“Though there were numerous vessels at this great distance in the horizon on every side, yet the vast spaces between them, like the spaces between the stars,—far as they were distant from us, so were they from one another,—nay, some were twice as far from each other as from us,—impressed us with a sense of the immensity of the ocean, the “unfruitful ocean,” as it has been called, and we could see what proportion man and his works bear to the globe.”
—Henry David Thoreau (1817–1862)