Hamming distance

1 Hamming Distance

In comparing two bit patterns, the Hamming distanceMathworldPlanetmathPlanetmath is the count of bits different in the two patterns. More generally, if two ordered lists of items are compared, the Hamming distance is the number of items that do not identically agree. This distancePlanetmathPlanetmath is applicable to encoded information, and is a particularly simple metric of comparison, often more useful than the city-block distance or Euclidean distance.

The Hamming distance is a true metric, as it induces a metric space on the set of ordered lists of some fixed length.


  • 1 The Data Analysis Briefbook, http://rkb.home.cern.ch/rkb/titleA.htmlhttp://rkb.home.cern.ch/rkb/titleA.html
Title Hamming distance
Canonical name HammingDistance
Date of creation 2013-03-22 12:07:05
Last modified on 2013-03-22 12:07:05
Owner Mathprof (13753)
Last modified by Mathprof (13753)
Numerical id 11
Author Mathprof (13753)
Entry type Definition
Classification msc 94C99
Classification msc 05C12
Related topic Metric
Related topic HammingMetric