Scribd
Upload
27 views

Assignment No 2. CS601

Uploaded by

fxsameen
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
27 views

Assignment No 2. CS601

Uploaded by

fxsameen
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/ 1

Student ID: BC230412800

Name: Muhammad Sameen

Code: CS601

Question No. 1 Solution

Find Hamming Distance among each pair of words as given in the following table and fill the
“Hamming Distance” column:

Serial No. Pair of Words Hamming Distance (d)

A (10001, 11110) 4

B (11100, 11011) 3

C (10101, 11010) 4

D (01101, 10111) 3

Question No. 2 Solution

To ensure reliable exchange of messages, a sender and receiver have agreed to use the “Even Parity
Check.” The sender will append a parity bit to each message, which can then be verified by the
receiver. Considering the data bits of each message given in the following table, calculate the parity
bit for each message and write it in the Parity Bit column:

Message # Data Bits in Message Parity Bit

1 1 0 1 1 1 1 1 1 0

2 1 1 1 0 1 0 0 1 1

3 1 1 1 1 0 0 0 0 1

4 1 0 0 1 0 0 1 0 1

5 1 1 0 0 0 0 1 1 0

You might also like