

















Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
data communication chapter 10 (1) slideshare
Typology: Slides
1 / 25
This page cannot be seen from the preview
Don't miss anything!


















Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Note
Note
Figure 10.1 Single-bit error
Note
Note
Note
In block coding, we divide our message into blocks,
In block coding, we divide our message into blocks,
each of k bits, called
each of k bits, called datawords
datawords
. We add r redundant . We add r redundant
bits to each block to make the length n = k + r. The
bits to each block to make the length n = k + r. The
resulting n-bit blocks are called
resulting n-bit blocks are called codewords
codewords .
Error Detection
Error Correction
Hamming Distance
Minimum Hamming Distance
Topics discussed in this section:
Topics discussed in this section:
Figure 10.5 Datawords and codewords in block coding
Figure 10.6 Process of error detection in block coding
111 is received. This is not a valid codeword and is
discarded.
000 is received. This is a valid codeword. The receiver
incorrectly extracts the dataword 00. Two corrupted
bits have made the error undetectable.
Table 10.1 A code for error detection (Example 10.2)