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:
“The rage for road building is beneficent for America, where vast distance is so main a consideration in our domestic politics and trade, inasmuch as the great political promise of the invention is to hold the Union staunch, whose days already seem numbered by the mere inconvenience of transporting representatives, judges and officers across such tedious distances of land and water.”
—Ralph Waldo Emerson (1803–1882)