Hamming distance


Also found in: Acronyms, Wikipedia.

hamming distance

[′ham·iŋ ‚dis·təns]
(computer science)

Hamming distance

(data)
The minimum number of bits that must be changed in order to convert one bit string into another.

Named after the mathematician Richard Hamming.

References in periodicals archive ?
The extension of this in IVNS has been used here to find separation measures based on the Hamming distance.
The model D also fully and adequately presents all data about the objects of this special virtual world V, that is why Hamming distance between D and V is minimal again ([hd.
If the dominant hamming distance between two adjacent individuals is less than the setting threshold [M.
We introduce computation of Hamming distance between two LBP codes in Section 2.
The average overall ratios (query accuracy) and the average rank-i ratios of the Hamming distance are accurate.
n]} be the SVNPIS; then, the weighted Hamming distance measure (WHDM) between [A.
In the following we defined the weighted Hamming distance with w = {[w.
The stop criterion of AutDAG, introduced in the sixth step by finding a codeword at Hamming distance less than or equal to the threshold of decoding T, from the received word h, allows reducing considerably the run time of this algorithm.
Weight and Hamming distance are treated in Section 3.
3 show that the 'random bit selection' is the worst, and the fixed chunk selection method produces the minimum average Hamming distance for all parameters.
The Hamming distance of two iris codes before and after encryption remain the same, as long as the keys used to encrypt them are identical.