Problem
Your boss has heard a lot about cyclic redundancy checksum but is not convinced that it is much better than simple parity. You quote some of the numbers and probabilities of error detection, but they mean little. If you could give a more concrete example of how good cyclic redundancy checksum is, you might win the boss over. Recall the probabilities given in Table 6-4. If your company transmits a continuous stream of data at 128,000 bits per second, how much time will pass before cyclic redundancy checksum lets an error slip through?