1. Alice picks a bit b at random. She picks b = 0 with probability p = 0.2, and she picks b = 1 with complementary probability p= 0.8. 2A. Alice sets c = b. 2B. Alice sets c= b. 2C. Alice sets c =1 – b. 3. Alice sends the bit e through the channel. 4. The channel is noisy, and it flips the bit with probability 0.1 if c = 0, and it flips the bit with probability 0.3 if c= 1. Let d' denote the output of the channel. 5. Bob receives the bit c'. SA. Bob sets b' = d'. SB. Bob ignores the bit e' and he sets b' = 1, regardless of whether d' = 0 or c' = 1. SC. Bob sets b' = 1 – '. %3D
1. Alice picks a bit b at random. She picks b = 0 with probability p = 0.2, and she picks b = 1 with complementary probability p= 0.8. 2A. Alice sets c = b. 2B. Alice sets c= b. 2C. Alice sets c =1 – b. 3. Alice sends the bit e through the channel. 4. The channel is noisy, and it flips the bit with probability 0.1 if c = 0, and it flips the bit with probability 0.3 if c= 1. Let d' denote the output of the channel. 5. Bob receives the bit c'. SA. Bob sets b' = d'. SB. Bob ignores the bit e' and he sets b' = 1, regardless of whether d' = 0 or c' = 1. SC. Bob sets b' = 1 – '. %3D
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
![Consider the following two-party communication problem. Alice and Bob are spatially separated, and their
only mcans of communication is through a noisy communication channel. Alice wants to send a random bit b
to Bob using their shared channel. At the end of the protocol, Bob has a bit b’. Our goal is that the probability
that b' = b is as high as possible.
We consider three different protocols for achieving this task, protocols PA, PB, and Pc. The three protocols
are the same, except for steps 2 and 6.
1. Alice picks a bit b at random. She picks b = 0 with probability p = 0.2, and she picks b = 1 with
complementary probability p= 0.8.
2A. Alice sets c= b.
2B. Alice sets c= b.
2C. Alice sets c= 1 – b.
3. Alice sends the bit c through the channel.
4. The channel is noisy, and it flips the bit with probability 0.1 if c= 0, and it flips the bit with probability
0.3 if c= 1. Let c' denote the output of the channel.
5. Bob receives the bit c'.
6A. Bob sets b' = c'.
6B. Bob ignores the bit c' and he sets b' = 1, regardless of whcther d' = 0 or c = 1.
6C. Bob sets b' = 1 – c'.
7. Bob declares that "I am guessing that Alice sent the bit b'."
1. For cach of three protocols, compute the probability Pr[b' = b].
Compute the probability as an irreducible fraction (that is, answer e.g. instead of ).
Show your calculations and succinctly explain your work.
2. At the top of your answer, include a table with the three probabilities. Give your probabilities with
three significant digits, as in the cexample below.
РА
0.123
PB
Pc
0.987](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F7c6a465b-052b-417f-8147-e9a3e4854bb5%2F2cbc5f79-5a46-46e5-89d9-8293c4862790%2F3yeyjo6_processed.png&w=3840&q=75)
Transcribed Image Text:Consider the following two-party communication problem. Alice and Bob are spatially separated, and their
only mcans of communication is through a noisy communication channel. Alice wants to send a random bit b
to Bob using their shared channel. At the end of the protocol, Bob has a bit b’. Our goal is that the probability
that b' = b is as high as possible.
We consider three different protocols for achieving this task, protocols PA, PB, and Pc. The three protocols
are the same, except for steps 2 and 6.
1. Alice picks a bit b at random. She picks b = 0 with probability p = 0.2, and she picks b = 1 with
complementary probability p= 0.8.
2A. Alice sets c= b.
2B. Alice sets c= b.
2C. Alice sets c= 1 – b.
3. Alice sends the bit c through the channel.
4. The channel is noisy, and it flips the bit with probability 0.1 if c= 0, and it flips the bit with probability
0.3 if c= 1. Let c' denote the output of the channel.
5. Bob receives the bit c'.
6A. Bob sets b' = c'.
6B. Bob ignores the bit c' and he sets b' = 1, regardless of whcther d' = 0 or c = 1.
6C. Bob sets b' = 1 – c'.
7. Bob declares that "I am guessing that Alice sent the bit b'."
1. For cach of three protocols, compute the probability Pr[b' = b].
Compute the probability as an irreducible fraction (that is, answer e.g. instead of ).
Show your calculations and succinctly explain your work.
2. At the top of your answer, include a table with the three probabilities. Give your probabilities with
three significant digits, as in the cexample below.
РА
0.123
PB
Pc
0.987
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY