Does it work for binary?
Yes, it works for any strings, including binary sequences (e.g., 1011 vs 1001).
Calculator
Enter your values
Analysis
Interpretation of the current calculator output
Enter values to see detailed analysis and insights.
How to Use
Step-by-step instructions
- 1Enter the first string.
- 2Enter the second string (must be same length).
- 3The calculator will show the Hamming distance.
Symbol Difference
Counts the number of positions at which the corresponding symbols are different.
Distance = Σ (s1[i] ≠ s2[i])Variables:
s1First strings2Second stringExample
Text Comparison
Inputs:
String 1:karolin
String 2:kathrin
Steps:
- 1.k=k, a=a, r!=t, o!=h, l!=r, i=i, n=n
- 2.Differences: r/t, o/h, l/r
- 3.Count = 3
Result:
3