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:
“And then he heard some old forgotten talk
At a short distance like a hundred miles
Filling the air with its secrecy,
And was afraid of all the living air....”
—Allen Tate (1899–1979)