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:
“1946: I go to graduate school at Tulane in order to get distance from a “possessive” mother. I see a lot of a red-haired girl named Maude-Ellen. My mother asks one day: “Does Maude-Ellen have warts? Every girl I’ve known named Maude-Ellen has had warts.” Right: Maude-Ellen had warts.”
—Bill Bouke (20th century)