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:
“A solitary traveler whom we saw perambulating in the distance loomed like a giant. He appeared to walk slouchingly, as if held up from above by straps under his shoulders, as much as supported by the plain below. Men and boys would have appeared alike at a little distance, there being no object by which to measure them. Indeed, to an inlander, the Cape landscape is a constant mirage.”
—Henry David Thoreau (1817–1862)