Q No.

(Part a)

Mention the Hamming distance associated with each Pair of Words as given in the following table.
5 Marks

Pair of Words Hamming Distance

d (10100, 00010) 3
d (1101, 10101) 2
d (10111,1100) 4
d (010,10000) 2
d (1110,0111) 2

(Part b)

Suppose a Block code has a Hamming Distance of 6. You are required to mention the number of
corrupted / altered bits that the Block code will guarantee to detect. Write all necessary formulas
and calculations steps to give your answer.

d min  6
Formula
d min  s  1
Where s is the detectable errors
d min  s  1  s  d min  1
s  d min  1
Putting the values
s  6 1
s5 Answer
Q No.2

Suppose a sender wants to send “10111011010010111011010101110100” data bits to a

destination. By writing all necessary calculation steps, you are required to compute the 8-bit
Checksum that the sender will send to destination along with original data bits:

10111011010010111011010101110100
Divided int o 8 bit codes
10111011 01001011 10110101 01110100
Converting int o Decimal
187 75 181 116
Sum  559
559  1000101111
00101111
 10
00110001  49
Taking 1's complement
11001110 2   206 10 Answer