Scribd
Upload
3 views

4. Tutorial 2 (Module 2)

The document outlines a tutorial on data link layer concepts, including bit stuffing, character encoding, error detection and correction using Hamming code, and CRC (Cyclic Redundancy Check). It provides specific examples and problems related to transmitting bit strings, encoding characters, generating codewords, and calculating check bits for error detection. The tutorial emphasizes practical applications of these concepts in ensuring data integrity during transmission.

Uploaded by

Dhanya Ratheesh
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

4. Tutorial 2 (Module 2)

The document outlines a tutorial on data link layer concepts, including bit stuffing, character encoding, error detection and correction using Hamming code, and CRC (Cyclic Redundancy Check). It provides specific examples and problems related to transmitting bit strings, encoding characters, generating codewords, and calculating check bits for error detection. The tutorial emphasizes practical applications of these concepts in ensuring data integrity during transmission.

Uploaded by

Dhanya Ratheesh
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

TUTORIAL 2 – MODULE 2

14/10/2022
1. A bit string, 0111101111101111110, needs to be transmitted at the data link layer. If
the flag used is 01111110, what is the string actually transmitted after bit stuffing?
2. Consider the following character encoding used in a data link protocol:
A: 01000111 B: 11100011 FLAG:01111110 ESC:11100000
Show the bit sequence transmitted for the sequence: A B ESC FLAG for the following
cases
(1) Character count
(2) Flag bytes with byte stuffing
(3) Starting and ending flag bytes with bit stuffing
3. The data bits=10010. Generate codeword. Show how the receiver detects and corrects
error in the received bit stream 10110.
[Hint: Insert the parity bits (obtained while generating the codeword) in the
correct positions to the received data 10110]
4. The codeword 11110101101 is received using hamming encoding algorithm. What was
the original code sent
5. What is CRC. If the generating polynomial for CRC code is x3+x+1 the message word
is 11010011101100. Determine the check bits and the encoded word. How does the
receiver know that an error has occurred? What is the result of the receiver’s CRC
calculations?

You might also like