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.
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
Well the Hamming weight of a length-N word x denoted w(x) is defined as the number of components (symbols) of x that are nonzero.
Well there is no special formula about the hamming weight it can be formulated as w(x)= \sumI{x\neq0}
where I{x\neq0}, the indicator of event {x\neq0}, is 1 if...
hi,
I have to show the following properties of the Hamming weight for binary words x and y of equal lenght:
a)w(x+y)=w(x)+w(y)-2w(x*y)
b)w(x+y)>=w(x)-w(y)
c) For w(y) even, w(x+y) is even iff w(x) is even
d) For w(y) odd, w(x+y) is odd iff w(x) is even
can anybody help me,
thanks
lenti