How can we show that the Hamming distance

[lenti]

Hi,

can anybody help me to show that the Hamming disatance d(x,y) is invarian to a shift of both x and y i.e d(x+z, y+z)=d(x,y)

Thanks a lot

Lenti

 

[Mark44]

Please include the formula for Hamming distance.

 

[lenti]

The Hamming distance of two length-N words x, y, denoted as d(x,y), is defined as the number of components (symbols9 of x and y tha are different.

we can writte as;

d(x,y)=\sumI{x\neqy}

thanks a lot

 

[Mark44]

Your summation doesn't make much sense to me. What does I in this summation mean?
\sum I \{x \neq y\}

Also, it would help to give an example. For example, is d("eat", "eats") = 1?

 

[lenti]

as an example;

consider two binary words x=(1010110) and y=(1001010)

the hamming distance between the binary words is d(x,y)=3

because they change in 3 bits.

 

[Mark44]

How about my question about the summation?

 

[Mark44]

Assuming that z is another string of bits, it's intuitively obvious that if d(x, y) = n, say, then creating two longer strings x + z and y + z will not change the number of bits that are different. IOW d(x + z, y + z) = n as well.

To formalize this, I would probably need the formula for Hamming distance, which you've provided, but I would also need to understand what this formula means, which I don't.