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:
“No doubt, the short distance to which you can see in the woods, and the general twilight, would at length react on the inhabitants, and make them savages. The lakes also reveal the mountains, and give ample scope and range to our thought.”
—Henry David Thoreau (1817–1862)