The Hamming distance between two binary strings of equal length is the number of positions at which the corresponding characters differ. Expressed as a fraction, it is:

Hamming distance fraction = (Number of differing positions)/(Total number of positions)​

This gives the proportion of positions where the two strings do not match, ranging from 0 (identical strings) to 1 (completely different strings). Therefore, this hamming distance fraction is equivalent to: