We wish to transmit an n-bit message to a recieving agent. The bits in the messa

Question

We wish to transmit an n-bit message to a recieving agent. The bits in the message are independantly corrupted (flipped) diming transmission with P probability each. With an extra parity bit sent along with the original information, a message can be corrected by the reciever if at most one bit in the entire message (including the parity bit) has been corrupted. Suppose we want to ensure that the correct message is recieved with probability at least 1 - S. What is the maximum feasible value of n? Calculate this value for the case e = 0.001 g(squigly symbol looks like a cursive s) = 0.01.

Explanation / Answer

p = .001 Trials = 148 Bad Bit = 0 or 1 .9901253 p = .001 Trials = 149 Bad Bit = 0 or 1 .9899976 You can use 148 bits with a reliability of .99.

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.