## You are here

HomeHamming distance

## Primary tabs

# Hamming distance

# 1 Hamming Distance

In comparing two bit patterns, the *Hamming distance* 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 distance 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.

# References

- 1 The Data Analysis Briefbook, http://rkb.home.cern.ch/rkb/titleA.html

Related:

Metric, HammingMetric

Type of Math Object:

Definition

Major Section:

Reference

Groups audience:

## Mathematics Subject Classification

94C99*no label found*05C12

*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff
- Corrections