Scribd
Upload
21 views

BC180203450 Data Communication CS601 Assignment No. 03 Qno1 Part A

The document contains two questions regarding Hamming distance and error detection codes. For the first question, it provides Hamming distances for various pairs of words. For the second part, it states that a code with Hamming distance of 6 can detect up to 5 corrupted bits. The second question asks to calculate the 8-bit checksum for a given data string by summing the decimal values of 8-bit sections and taking the 1's complement of the result.

Uploaded by

MH Amber
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
21 views

BC180203450 Data Communication CS601 Assignment No. 03 Qno1 Part A

The document contains two questions regarding Hamming distance and error detection codes. For the first question, it provides Hamming distances for various pairs of words. For the second part, it states that a code with Hamming distance of 6 can detect up to 5 corrupted bits. The second question asks to calculate the 8-bit checksum for a given data string by summing the decimal values of 8-bit sections and taking the 1's complement of the result.

Uploaded by

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

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

You might also like