Hamming Distance

With two strings:

• $v_1$
• $v_2$ The hamming distance $d(v_1,v_2)$ is the number of bits that are different.

Operation

• With $v_1,v_2\in Z_2$ (Integer Modulo 2)
• $d(v_1,v_2)$ is the number of 1’s in $v_1+v_2$

Example

• $v_1=(0,0,0,1,1,1,0,0,0)$
• $v_2=(0,1,0,1,0,1,0,0,0)$
• $d(v_1,v_2)=2$ As there are 2 entries that differ