0% found this document useful (0 votes)
10 views1 page

Practical Class-2 Error Control

This document presents 7 exercises on data link layer concepts such as error detection coding, Hamming codes, parity, and CRC. The exercises cover topics such as Hamming distance, single-bit error detection and correction using Hamming codes, even parity encoding, and polynomial division for CRC error detection.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
10 views1 page

Practical Class-2 Error Control

This document presents 7 exercises on data link layer concepts such as error detection coding, Hamming codes, parity, and CRC. The exercises cover topics such as Hamming distance, single-bit error detection and correction using Hamming codes, even parity encoding, and polynomial division for CRC error detection.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Practical Class-2 "Link Layer.

Error Control"

Prerequisites: Conference-4 Data Link Layer

Exercises

1. To provide greater reliability than a single parity bit can give, a


error detection coding scheme uses a parity bit for all
even number bits. What is the Hamming distance of this code?
2. The Hamming code is used to transmit 16-bit messages. How many bits of
Verification is needed to ensure that the receiver can detect and correct.
single bit errors? Show the transmitted bit pattern for the message
1101001100110101. Assume that even parity is used in the Hamming code.
3. A byte of 8 bits with a binary value of 10101111 will be encoded using code
of even parity Hamming. What is the binary value resulting from the encoding?
4. A 12-bit Hamming code, whose hexadecimal value is 0xE4F, arrives at the receiver.
What was the original hexadecimal value? Assume that no more than one bit is erroneous.
5. One way to detect errors is to transmit the data as a block of n rows of k.
bits per row and add parity bits to each row and each column. The bottom corner
right is a parity bit that checks its row and column. Will this detect it
Does it outline all simple errors? Double errors? Triple errors?
6. What remainder is obtained when dividing x7+ x5+ 1 into the generating polynomial x3+ 1?

7. A bit stream 10011101 is transmitted using the standard CRC method seen in
classes. The polynomial generator is x3+ 1. Show the actual bit string that is
transmits. Assume that the third bit, from left to right, is inverted during the
Transmission. Show that this error is detected on the receiver side.

You might also like