FOR FREE CONTENT

Hamming Distance :

Now next important question: 

Here we arrange 3 parity bit for the original message (4 bit)

# We arrange the parity bit in such a way that each parity bit takes the responsibility of some message bits (out of 4 bits).

If there is a problem in the set of original (code) then the corresponding parity says yes it has a problem (get corrupted).

Let’s take an example:

m = 4, p = 3 total bit = 7

m = 0101

And we have 7 bit:

# In seven (7) bits assign those code (bits) are parity which is the power of 2. 

# Accordingly message bits, each parity bit taking some of the message bit 

To select which parity bit is responsible for which set of message bit we use.

Here we are using even parity.

Check bits:

It has the following one category. Here parity bit present position number 1.

and

and

Now,

It does mean

Now we assign parity bit at original manage as per above combination (take care of parity bit to corresponding message bit)

As we know 

m = 0101

So, original message bit m = 0101

But we send to receiver 0100101 for error-correcting.

i.e. it checks 4 5 6 7 contain even parity bit or not if it contains even parity bit, and then it is okay (not corrupted).

But here, 

So,

This means location 5 has got an error. Yes, it’s correct at location number 5 we got an error.

So, location 5 is correct, we find the location.

Then to make correct we toggle the bit 0 to 1. Now the receiver gets the correct bit.

Another way we know the position.

It means,