A communications channel transmits the digits 0and 1. However, due to static, the digit transmitted is incorrectly received with probability 2. Suppose that we want to transmit an important message consisting of one binary digit. To reduce the chance of error, we transmit 00000 instead of 0 and 11111 instead of 1. If the receiver of the message uses “majority” decoding, what is the probability that the message will be wrong when decoded? What independence assumptions are you making?

Short Answer

Expert verified

The probability that the message is wrong when decoded is0.0579.

Step by step solution

01

Given Information

The probability that the digit transmitted incorrectly is, 0.2.

To reduce the chance of error 5digits are transmitted instead of 1digits.

The message is wrongly received when an3,4or5digits are transmitted incorrectly.

02

Solution of the Problem

The probability that the message will be wrong when decoded is,

P(Wrongmessage)=P(X3)

=53(0.2)3(0.8)2+54(0.2)4(0.8)1+55(0.2)5(0.8)0

=0.0512+0.0064+0.0003

We get,

=0.0579.

03

Final Answer

The probability that the message is wrong when decoded is0.0579.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

A sample of 3 items is selected at random from a box containing 20 items of which 4 are defective. Find the expected number of defective items in the sample.

Here is another way to obtain a set of recursive equations for determining Pn, the probability that there is a string of kconsecutive heads in a sequence of nflips of a fair coin that comes up heads with probability p:

(a) Argue that for k<n, there will be a string of kconsecutive heads if either

1. there is a string of kconsecutive heads within the first n-1flips, or

2. there is no string of kconsecutive heads within the first n-k-1flips, flip n-kis a tail, and flips n-k+1,,nare all heads.

(b) Using the preceding, relate PntoPn-1. Starting with Pk=pk, the recursion can be used to obtain Pk+1, thenPk+2, and so on, up to Pn.

An interviewer is given a list of people she can interview. If the interviewer needs to interview 5 people, and if each person (independently) agrees to be interviewed with probability 2 3 , what is the probability that her list of people will enable her to obtain her necessary number of interviews if the list consists of

(a) 5 people and

(b) 8 people? For part (b), what is the probability that the interviewer will speak to exactly

(c) 6 people and

(d) 7 people on the list?

There are ktypes of coupons. Independently of the types of previously collected coupons, each new coupon collected is of typeiwith probability pi, i=1kpi=1. If n coupons are collected, find the expected number of distinct types that appear in this set. (That is, find the expected number of types of coupons that appear at least once in the set of ncoupons.)

Let Xbe a random variable having expected value μand variance σ2. Find the expected value and variance ofY=X-μσ.

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free