Hamming Distance Measure

A Hamming Distance Measure is a string distance measure for equal length strings based on mismatched elements in the same string position.

• Context:
  • It can Count the differences in string Members.
• Example(s):
  • Hamming("A","A") ⇒ 0
  • Hamming("A","B") ⇒ 1
  • Hamming("B","A") ⇒ 1
  • Hamming("AB","AB") ⇒ 0
  • Hamming("AB","BB") ⇒ 1
  • Hamming("AA","BB") ⇒ 2
  • Hamming("toned", “roses") ⇒ 3.
  • Hamming(1011101, 10<u">01001) ⇒ 2.
  • Hamming(2173896, 2233796) ⇒ 3.
  • …
• Counter-Example(s):
  • Levenshtein Distance Function.
• See: Hamming Code, Hamming Decoder.

---

---

References

• http://www.maths.manchester.ac.uk/~pas/code/notes/part2.pdf

2012

• (Wikipedia, 2012) ⇒ http://en.wikipedia.org/wiki/Hamming_distance
  • QUOTE: 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.

---