10.

9 PRACTICE SET
Review Questions
1. How does a single-bit error differ from a burst
error?
2. Discuss the concept of redundancy in error
detection and correction.
3. Distinguish between forward error correction
versus error correction by retransmission.
4. What is the definition of a linear block code?
What is the definition of a cyclic code?
5. What is the Hamming distance? What is the
minimum Hamming distance?
6. How is the simple parity check related to the two-
dimensional parity check?
7. In CRC, show the relationship between the
following entities (size means the number
of bits):
a. The size of the dataword and the size of the
codeword
b. The size of the divisor and the remainder
c. The degree of the polynomial generator and the
size of the divisor
d. The degree of the polynomial generator and the
size of the remainder
8. What kind of arithmetic is used to add data items
in checksum calculation?
9. What kind of error is undetectable by the
checksum?
10. Can the value of a checksum be all Os (in
binary)? Defend your answer. Can the
value be allIs (in binary)? Defend your answer.
Exercises
11. What is the maximum effect of a 2-ms burst of
noise on data transmitted at the following
rates?
a. 1500 bps
b. 12 kbps
c. 100 kbps
d. 100 Mbps
12. Apply the exclusive-or operation on the
following pair of patterns (the symbol EB
means XOR):
a. (10001) EB (10000)
b. (10001) EB (10001) (What do you infer from the
result?)
c. (11100) EB (00000) (What do you infer from the
result?)
d. (10011) EEl (11111) (What do you infer from the
result?)
304 CHAPTER 10 ERROR DETECTIONAND
CORRECTION
13. In Table 10.1, the sender sends dataword 10. A
3-bit burst error corrupts the codeword.
Can the receiver detect the error? Defend your
answer.
14. In Table 10.2, the sender sends dataword 10. If a
3-bit burst en-or con-upts the first
three bits of the codeword, can the receiver detect
the error? Defend your answer.
15. What is the Hamming distance for each of the
following codewords:
a. d (10000, 00000)
b. d (10101, 10000)
c. d (11111,11111)
d. d (000, 000)
16. Find the minimum Hamming distance for the
following cases:
a. Detection of two en-ors.
b. Correction of two errors.
c. Detection of 3 errors or correction of 2 errors.
d. Detection of 6 errors or correction of 2 errors.
17. Using the code in Table 10.2, what is the
dataword if one of the following codewords
is received?
a. 01011
b. 11111
c. 00000
d. 11011
18. Prove that the code represented by Table 10.8 is
not a linear code. You need to find
only one case that violates the linearity.
Table 10.8 Table for Exercise 18
Dataword Codeword
00 00000
01 01011
10 10111
11 11111
19. Although it can mathematically be proved that a
simple parity check code is a linear
code, use manual testing of linearity for five pairs of
the codewords in Table 10.3 to
partially prove this fact.
20. Show that the Hamming code C(7,4) of Table
lOA can detect two-bit en-ors but not
necessarily three-bit error by testing the code in the
following cases. The character "V"
in the burst en-or means no en-or; the character "E"
means an error.
a. Dataword: 0100 Burst error: VEEVVVV
b. Dataword: 0111 Burst error: EVVVVVE
c. Dataword: 1111 Burst error: EVEVVVE
d. Dataword: 0000 Burst en-or: EEVEVVV
SECTION 10.9 PRACTICE SET 305
21. Show that the Hamming code C(7,4) of Table
lOA can correct one-bit errors but
not more by testing the code in the following cases.
The character "V" in the burst
error means no error; the character "E" means an
error.
a. Dataword: 0100 Burst error: EVVVVVV
b. Dataword: 0111 Burst error: VEVVVVV
c. Dataword: 1111 Burst error: EVVVVVE
d. Dataword: 0000 Burst error: EEVVVVE
22. Although it can be proved that code in Table
10.6 is both linear and cyclic, use
only two tests to partially prove the fact:
a. Test the cyclic property on codeword 0101100.
b. Test the linear property on codewords 0010110
and 1111111.
23. We need a dataword of at least 11 bits. Find the
values of k and n in the Hamming
code C(n, k) with dmin ::: 3.
24. Apply the following operations on the
corresponding polynomials:
a. (x3 + xl + X + 1) + (x4 + xl + x + 1)
b. (x3 + xl + x + 1) - (x4 + xl + x + 1)
c. (x3 + xl) X (x4 + x2 + x + 1)
d. (x3 + x2 + x + 1) / (x2 + 1)
25. Answer the following questions:
a. What is the polynomial representation of
10111O?
b. What is the result of shifting 101110 three bits to
the left?
c. Repeat part b using polynomials.
d. What is the result of shifting 101110 four bits to
the right?
e. Repeat part d using polynomials.
26. Which of the following CRC generators
guarantee the detection of a single bit
error?
a. x3 + x + 1
b. x4 + xl
c. 1
d. x2 + 1
27. Referring to the CRC-8 polynomial in Table 10.7,
answerthe following questions:
a. Does it detect a single error? Defend your answer.
b. Does it detect a burst error of size 6? Defend your
answer.
c. What is the probability of detecting a burst error
of size 9?
d. What is the probability of detecting a burst error
of size 15?
28. Referring to the CRC-32 polynomial in Table
10.7, answer the following questions:
a. Does it detect a single error? Defend your answer.
b. Does it detect a burst error of size 16? Defend
your answer.
c. What is the probability of detecting a burst error
of size 33?
d. What is the probability of detecting a burst error
of size 55?
306 CHAPTER 10 ERROR DETECTION AND
CORRECTION
29. Assuming even parity, find the parity bit for each
of the following data units.
a. 1001011
b. 0001100
c. 1000000
d. 1110111
30. Given the dataword 1010011110 and the divisor
10111,
a. Show the generation of the codeword at the
sender site (using binary division).
h. Show the checking of the codeword at the
receiver site (assume no error).
3 I. Repeat Exercise 30 using polynomials.
32. A sender needs to send the four data items
Ox3456, OxABCC, Ox02BC, and OxEEEE.
Answer the following:
a. Find the checksum at the sender site.
b. Find the checksum at the receiver site if there is
no error.
c. Find the checksum at the receiver site if the
second data item is changed to
OxABCE.
d. Find the checksum at the receiver site if the
second data item is changed to
OxABCE and the third data item is changed to
Ox02BA.
33. This problem shows a special case in checksum
handling. A sender has two data
items to send: Ox4567 and OxBA98. What is the
value of the checksum?
CHAPTER 11
Data Link Control
The two main functions of the data link layer are
data link control and media access
control. The first, data link control, deals with the
design and procedures for communication
between two adjacent nodes: node-to-node
communication. We discuss this
functionality in this chapter. The second function of
the data link layer is media access
control, or how to share the link. We discuss this
functionality in Chapter 12.
Data link control functions include framing, flow
and error control, and softwareimplemented
protocols that provide smooth and reliable
transmission of frames
between nodes. In this chapter, we first discuss
framing, or how to organize the bits that
are carried by the physical layer. We then discuss
flow and error control. A subset of
this topic, techniques for error detection and
correction, was discussed in Chapter 10.
To implement data link control, we need protocols.
Each protocol is a set of rules
that need to be implemented in software and run by
the two nodes involved in data
exchange at the data link layer. We discuss five
protocols: two for noiseless (ideal)
channels and three for noisy (real) channels. Those
in the first category are not actually
implemented, but provide a foundation for
understanding the protocols in the second
category.
After discussing the five protocol designs, we show
how a bit-oriented protocol is
actually implemented by using the High-level Data
Link Control (HDLC) Protocol as an