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:
“From a distance the rushing of the torrent delights and uplifts us, but it rocks us in a flimsy boat, we are overwhelmed by despair. The same applies to danger.”
—Franz Grillparzer (1791–1872)