Scribd
Upload
914 views

CS 601 Assignment 2

The document discusses two questions about computing Hamming distance and checksum for error detection in data transmission. For the first question, it provides the pairs of words and their corresponding Hamming distances, noting some are imbalanced in length. For the second question, it shows the steps to split the data bits into segments, add the segments, take the 1's complement to get an 8-bit checksum for error detection.

Uploaded by

Umer Aslam
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
914 views

CS 601 Assignment 2

The document discusses two questions about computing Hamming distance and checksum for error detection in data transmission. For the first question, it provides the pairs of words and their corresponding Hamming distances, noting some are imbalanced in length. For the second question, it shows the steps to split the data bits into segments, add the segments, take the 1's complement to get an 8-bit checksum for error detection.

Uploaded by

Umer Aslam
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/ 2

CS 601

Assignment No 2

Question No.1
Given are the pairs of words in the following table.

You are required to mention the Hamming distance associated with each Pair of Words

Answer:

Pair of Words Hamming Distance

d (10111,1100) Imbalanced Length

d (1101, 10101) Imbalanced Length

d (10100, 00010) 3

d (1110,0111) 2

d (010,10000) Imbalanced Length

Question No.2
Consider a sender station wants to send “10111011010010111011010101110100”data bits to a
destination station. You are required to compute the 8-bit Checksum that the sender will send to
destination along with original data bits. Write all necessary calculation steps.

Answer:

Step 1:
To compute the 8-bit Checksum you will split the data into equal sized segment.

10111011

01001011

10110101

01110100

Step 2:
Perform the addition on segment.

10111011+01001011+10110101+01110100 = 00110011

Step 3:

Take 1s complement result from step 2.


00110011-> 11001100

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy