Consider the simple error-detection scheme of parity checking , in which the sen

Question

Consider the simple error-detection scheme of parity checking, in which the sender appends to each 7-bit "message" an 8th bit to make the total number of 1's in the 8 bits an even number. The receiver checks the number of 1's in the 8-bit message and signals an error if this is an odd number. This works well for an odd number of errors, but fails to detect an even number of errors. (Google this if you are unclear about the algorithm.) Suppose that each bit is received correctly with probability 0.999, independently of the other bits. What is the probability that the receiver signals that a message has an error, but the error is NOT detected by the parity check?

Explanation / Answer

Please refer to the solution

http://www.chegg.com/homework-help/simplest-error-detection-scheme-used-data-communication-pari-chapter-5.1-problem-27e-solution-9780131453401-exc

http://www.chegg.com/homework-help/exercise-27-suppose-message-consisting-six-characters-transm-chapter-5.1-problem-28e-solution-9780131453401-exc

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects