0% found this document useful (0 votes)
52 views12 pages

Construction of Hamming Code

Programming

Uploaded by

62zahiir
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
52 views12 pages

Construction of Hamming Code

Programming

Uploaded by

62zahiir
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

ConstruCtion of

Hamming Code

1
Suppose the data to be transmitted is
1011001 with firstly even parity and
secondly with odd parity, the bits will be
placed as follows:

2
Determining the Parity bits:
R1 bit is calculated using parity check at all
the bits positions whose binary
representation includes a 1 in the least
significant position. R1: bits 1, 3, 5, 7, 9, 11

3
To find the redundant bit R1, we check for
even parity. Since the total number of 1’s in
all the bit positions corresponding to R1 is an
even number the value of R1 (parity bit’s
value) = 0

=0
4
To find the redundant bit R1, we check for
odd parity. Since the total number of 1’s in
all the bit positions corresponding to R1 is an
even number the value of R1 (parity bit’s
value) = 1

=1
5
R2 bit is calculated using parity check at all
the bits positions whose binary
representation includes a 1 in the second
position from the least significant bit. R2: bits
2,3,6,7,10,11

6
To find the redundant bit R2, we check for
even parity. Since the total number of 1’s in
all the bit positions corresponding to R2 is
odd the value of R2(parity bit’s value)=1

=1 7
R4 bit is calculated using parity check at all
the bits positions whose binary
representation includes a 1 in the third
position from the least significant bit. R4: bits
4, 5, 6, 7

8
To find the redundant bit R4, we check for
even parity. Since the total number of 1’s in
all the bit positions corresponding to R4 is
odd the value of R4(parity bit’s value) = 1

=1 9
R8 bit is calculated using parity check at all
the bits positions whose binary
representation includes a 1 in the fourth
position from the least significant bit. R8: bit
8,9,10,11

10
To find the redundant bit R8, we check for
even parity. Since the total number of 1’s in
all the bit positions corresponding to R8 is an
even number the value of R8(parity bit’s
value)=0. Thus, the data transferred is:

11
• The corresponding Hamming Code to be transmitted with even parity
is

• The corresponding Hamming Code to be transmitted with odd parity


is

12

You might also like