## Example 2: Hamming code and Parity bit

Eg.  Now form a hamming code for 5-bit information bits 10110 with odd parity m=5 and we have to follow         2p >= m + p + 1 The value of p as 4 to satisfy 24 (16) >= 5 + 4 + 1 but p=3 doesn’t satisfy as 23 (8) >= 5 + 3 + 1 So […]

## Example 1: Hamming code & parity bit

Eg. So let’s form hamming code using 4-bit message bits 1101 with parity bits as even parity bit and check how it is able to detect and correct error. As we have already decided parity bit positions and their corresponding message bits for a 4-bit message For the moment we have hamming code as P1    P2    1 P3 1 […]

## Parity bit relation with message bits

E.g.  Consider the parity bit P1 and we have to find the position of message bits which we’ll cover with this parity bit. Firstly write the binary equivalents of positions of message bit Bit1        bit2       bit3        bit4        bit5        bit6        bit7 Parity    parity                    parity P1                  P2             M1                P3           M2               M3          M4  001          010         011 […]

## Hamming code

This code is used for single error correction i.e. using this code we can detect only single error. In parity bit method we used only single extra bit but in this method number of extra bits (which also are parity bits) vary with the number of bits of the message. Suppose we have the number […]