Escolar Documentos
Profissional Documentos
Cultura Documentos
Homework #1
Input Output
1-ε1
0 0
ε1
ε2
1-ε2
1 1
Fig. P2.2
1
transmit information? (note a typo in the book says “Example 2.23” but Example 2.26 is
the correct one.)
Example 2.26 describes a binary communications system represented below. The input
is equally likely to be 0 or 1. The receiver makes random decision errors (about the input)
with probability . Let Ai be the event “input was i”, while Bi is the event “receiver decision
was i.” In example 2.26, the a posteriori probabilities were found to be
P (A0 |B1 ) =
P (A1 |B1 ) = 1 −
Input Output
1-!
P(0) = 0.5 0
!
!
1-!
P(1) = 0.5 1
string runlength k
1 0
01 1
001 2
000 3
2
Problem 9. textbook problem 2.92
Suppose that in Example 2.40, computer A sends each message to computer B simultaneously
over two unreliable telephone lines. Computer B can detect when errors have occured in
either line. Let the probability of message transmission error in line 1 and line 2 be q1 and q2
respectively. Computer B requests retransmissions until it receives an error-free message on
either line. (a) Find the probability that more than k transmissions are required. (b) Find
the probability that in the last transmission, the message on line 2 is received free of errors.
a→1
b → 01
c → 001
d → 0001
e → 0000
Let the random variable Y be equal to the length of the binary string output by the system.
Specify the sample space of Y , SY , and the probabilities of its values.
pk (n − k + 1)p (n + 1)p − k
= =1+
pk−1 kq kq
(b) Show that part (a) implies that (1) P (X = k) is maximum at kmax = [(n + 1)p], where
[x] denotes the largest integer that is smaller than or equal to x; and (2) when (n + 1)p is
an integer, then the maximum is achieved at kmax and kmax − 1.
3
In a packet-switched network, large data messages are divided into packets that can travel
different routes to the same destination. If the packets arrive at the destination in a different
order, they are resequenced in the correct order to reassemble the original data message.
Suppose that a data message is divided into N packets, which can arrive in any random
order with equal likelihood. What is the probability that they will arrive in the correct
order?