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.

Bibliography

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

"Hamming distance" is owned by Mathprof. [ full author list (2) | owner history (2) ]

(view preamble)

See Also: metric, Hamming metric

Log in to rate this entry.
(view current ratings)

Cross-references: fixed, metric space, Euclidean distance, city-block distance, metric, distance
There are 3 references to this entry.

This is version 7 of Hamming distance, born on 2002-01-04, modified 2007-07-05.
Object id is 1263, canonical name is HammingDistance.
Accessed 11627 times total.

Classification:

AMS MSC:	05C12 (Combinatorics :: Graph theory :: Distance in graphs)
	94C99 (Information and communication, circuits :: Circuits, networks :: Miscellaneous)

Pending Errata and Addenda

None.[ View all 3 ]

Discussion

forum policy

No messages.

Interact