Hamming Distance: Difference between revisions
Jump to navigation
Jump to search
m (Ovidiu moved page Hanning Distance to Hamming Distance without leaving a redirect) |
|||
| Line 5: | Line 5: | ||
=Overview= | =Overview= | ||
The Hamming distance between two string of equal length is the number of positions at which the corresponding symbols are different. In other words, it measures the minimum number of substitutions required to change on string into the other, or the minimum number of errors that could have transformed one string into the other. | The Hamming distance between two string of equal length is the number of positions at which the corresponding symbols are different. In other words, it measures the minimum number of substitutions required to change on string into the other, or the minimum number of errors that could have transformed one string into the other. | ||
=Implementations= | |||
==Hamming Distance between Two Bytes in Java== | |||
Revision as of 20:44, 24 October 2021
External
Internal
Overview
The Hamming distance between two string of equal length is the number of positions at which the corresponding symbols are different. In other words, it measures the minimum number of substitutions required to change on string into the other, or the minimum number of errors that could have transformed one string into the other.