| Version current |
Version 6 |
| \PMlinkescapeword{information} |
|
| \PMlinkescapeword{length} |
|
| \PMlinkescapeword{simple} |
|
|
|
| \section{Hamming Distance} |
\section{Hamming Distance} |
|
|
|
In comparing two bit patterns, the \emph{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.
|
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. |
The Hamming distance is a true metric, as it induces a metric space on the set of ordered lists of some fixed length. |
|
|
| \begin{thebibliography}{3} |
\begin{thebibliography}{3} |
|
|
| \bibitem{DAB} The Data Analysis Briefbook, \PMlinkexternal{http://rkb.home.cern.ch/rkb/titleA.html}{http://rkb.home.cern.ch/rkb/titleA.html} |
\bibitem{DAB} The Data Analysis Briefbook, \PMlinkexternal{http://rkb.home.cern.ch/rkb/titleA.html}{http://rkb.home.cern.ch/rkb/titleA.html} |
|
|
| \end{thebibliography} |
\end{thebibliography} |
