BC180203450

Data Communication CS601

Assignment No. 03

Q NO 1

PART A

Mention the Hamming distance associated with each Pair of Words as

given in the following table.

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:

dmin  S  1

Where S is detachable error,

dmin  S  1  S  d min  1

S  dmin  1

Putting the values

S=6-1

S=5

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 into 8 bit codes

10111011. 01001011. 10110101. 01110100

Converting into decimal number system

187.75.181.116

Sum is

187+75+181+116

Sum is 559

Now converting into binary number system.

559=1000101111

00101111
+10
0011001
=49

Taking 1’s complement

(11001110)2 = (206)10 Answer