0% found this document useful (0 votes)
31 views8 pages

Thẻ Ghi Nhớ - Chapter 10 - Problems - Quizlet

Chapter 10 covers various problems related to data transmission, including calculating the effects of noise, probabilities of bit corruption, and error detection methods. It discusses operations like Exclusive-OR, Hamming distance, and CRC code generation, along with parity checks and polynomial operations. The chapter provides practical examples and exercises to reinforce understanding of these concepts.

Uploaded by

chantunmmo01
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)
31 views8 pages

Thẻ Ghi Nhớ - Chapter 10 - Problems - Quizlet

Chapter 10 covers various problems related to data transmission, including calculating the effects of noise, probabilities of bit corruption, and error detection methods. It discusses operations like Exclusive-OR, Hamming distance, and CRC code generation, along with parity checks and polynomial operations. The chapter provides practical examples and exercises to reinforce understanding of these concepts.

Uploaded by

chantunmmo01
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

21:28, 30/04/2022 Thẻ ghi nhớ: Chapter 10 - Problems | Quizlet

Giải thích Thư viện của bạn Nâng cấp: dùng ...
Ảnh

Chapter 10 - Problems
17 người học trong một ngày vừa qua

Thuật ngữ trong học phần này (30)

What is the maximum effect of a 2-ms max effect = (data rate) * (burst duration)
burst of noise on data transmitted at
the following rates? a. (1500)x(2x10^-3) = 3bits
b. 24 bits
a. 1500 bps c. 200 bits
b. 12 kbps d. 200,000 bits
c. 100 kbps
d. 100 Mbps

Chapter 10 - Problems
https://quizlet.com/489483213/chapter-10-problems-flash-cards/ 1/8
21:28, 30/04/2022 Thẻ ghi nhớ: Chapter 10 - Problems | Quizlet

Assume that the probability that a bit [n!/(k! x (n-k)!)] x p^k x (1-p)^(n-k)
in a data unit is corrupted during
transmission is p. Find the probability a. 0.336
that x number of bits are corrupted in b. 0.14
an n bit data unit for each of the c. 0.084
following cases.

a. n = 8, x = 1, p = 0.2
b. n = 16, x = 3, p = 0.3
c. n = 32, x = 10, p = 0.4

Exclusive-OR (XOR) is one of the a. 00000


most used operations in the b. 11100
calculation of codewords. Apply the c. 01100
exclusive-OR operation on the
following pairs of patterns. Interpret
the results.

a. (10001) ⊕ (10001)
b. (11100) ⊕ (00000)
c. (10011) ⊕ (11111)

Chapter 10 - Problems
https://quizlet.com/489483213/chapter-10-problems-flash-cards/ 2/8
21:28, 30/04/2022 Thẻ ghi nhớ: Chapter 10 - Problems | Quizlet

In Table 10.1, the sender sends 10 -> 101


dataword 10. A 3-bit burst error
corrupts the codeword. Can the After burst error the codeword becomes 010.
receiver detect the error? Defend
your answer This is not a valid codeword, so the receiver detects the error and discards it.

00/00000
Using the code in Table 10.2, what is
01/01011
the dataword if each of the following
10/10101
codewords is received?
11/11110

a. 01011
a. 01
b. 11111
b. error
c. 00000
c. 00
d. 11011
d. error

Prove that the code represented by xor 2nd and 3rd


the following codewords is not linear.
You need to find only one case that 01011 XOR 10111 = 11100
violates the linearity.
not in input set => violates linearity
{(00000), (01011), (10111), (11111)}

Chapter 10 - Problems
https://quizlet.com/489483213/chapter-10-problems-flash-cards/ 3/8
21:28, 30/04/2022 Thẻ ghi nhớ: Chapter 10 - Problems | Quizlet

What is the Hamming distance for a. 1


each of the following codewords? b. 2
c. 5
a. d (10000, 00000) d. 0
b. d (10101, 10000)
c. d (00000, 11111)
d. d (00000, 00000)

Although it can be formally proved a. Do a left shift (move all bits to the right) => 0010110. This is also a codeword
that the code in Table 10.3 is both
linear and cyclic, use only two tests to b. XOR => 1101001. This is another codeword.
partially prove the fact:

a. Test the cyclic property on


codeword 0101100.
b. Test the linear property on
codewords 0010110 and 1111111.

Chapter 10 - Problems
https://quizlet.com/489483213/chapter-10-problems-flash-cards/ 4/8
21:28, 30/04/2022 Thẻ ghi nhớ: Chapter 10 - Problems | Quizlet

Referring to the CRC-8 in Table [10].4, x^8+x^2+x+1


answer the following questions:
a. Y
a. Does it detect a single error? b. Y (can detect 8 or less)
Defend your answer. c. 1-(0.5)^[8-1] = 0.992
b. Does it detect a burst error of size d. 1-(0.5)^[8]= 0.996
6? Defend your answer.
c. What is the probability of detecting L = r+1 vs L > r+1
a burst error of size 9?
d. What is the probability of detecting
a burst error of size 15?

Assuming even parity, find the parity a. even=>0=>01001011


bit for each of the following data units. b. even=>0=>00001100
c. odd=>1=>11000000
a. 1001011 d. even=>0=>01110111
b. 0001100
c. 1000000
d. 1110111

Chapter 10 - Problems
https://quizlet.com/489483213/chapter-10-problems-flash-cards/ 5/8
21:28, 30/04/2022 Thẻ ghi nhớ: Chapter 10 - Problems | Quizlet

.A simple parity-check bit, which is a. Detected and correct


normally added at the end of the
word (changing a 7-bit ASCII b. Detected but not corrected
character to a byte), cannot detect
even numbers of errors. For example, c. Detected but not corrected
two, four, six, or eight errors cannot
be detected in this way. A better d. Cant be detected or corrected
solution is to organize the characters
in a table and create row and column
parities. The bit in the row parity is
sent with the byte, the column parity
is sent as an extra byte (Figure 10.23).

a. An error at (R3, C3).


b. Two errors at (R3, C4) and (R3, C6).
c. Three errors at (R2, C4), (R2, C5),
and (R3, C4).
d. Four errors at (R1, C2), (R1, C6), (R3,
C2), and (R3, C6).

Given the dataword 101001111 and the 1010 01111 01010


divisor 10111, show the generation of
the CRC codeword at the sender site
(using binary division).

Chapter 10 - Problems
https://quizlet.com/489483213/chapter-10-problems-flash-cards/ 6/8
21:28, 30/04/2022 Thẻ ghi nhớ: Chapter 10 - Problems | Quizlet

Apply the following operations on the a. x^4+x^3+2x^2+2x+2


corresponding polynomials: b. -x^4+x^3
c. x^7+x^6+x^5+2x^4+2x^3+x^2
a. (x3 + x2 + x + 1) + (x4 + x2 + x + 1) d. x+1
b. (x3 + x2 + x + 1) − (x4 + x2 + x + 1)
c. (x3 + x2) × (x4 + x2 + x + 1)
d. (x3 + x2 + x + 1) / (x2 + 1)

Answer the following questions: a. x^5+x^3+x^2+x


b. 101110000
a. What is the polynomial c. x^8+x^6+x^5+x^4
representation of 101110? d. 10
b. What is the result of shifting 101110 e. x
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.

Chapter 10 - Problems
https://quizlet.com/489483213/chapter-10-problems-flash-cards/ 7/8
21:28, 30/04/2022 Thẻ ghi nhớ: Chapter 10 - Problems | Quizlet

Which of the following CRC More than one term and coefficient of x^0 is 1
generators guarantee the detection of
a single bit error? a. Y
b. N
a. x3 + x + 1 c. N
b. x4 + x2 d. Y
c. 1
d. x2 + 1

https://quizlet.com/489483213/chapter-10-problems-flash-cards/ 8/8

You might also like