Problem 8 Answer the following questions for a CRC-12; i.e., P(x) = x12 + X11 + X® + x² + x + 1. a) Does it detect singl
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
Problem 8 Answer the following questions for a CRC-12; i.e., P(x) = x12 + X11 + X® + x² + x + 1. a) Does it detect singl
questions for a CRC-12; i.e., P(x) = x12 + X11 + X® + x² + x + 1. a) Does it detect single-bit errors? Explain? b) Does it detect two separated single-bit errors? What is the maximum bit position difference separating two bit errors that guarantees that this two-bit error is detected? That is, letting i and j denote the bit positions of the two bits in error, what is the maximum j-i value guaranteeing detection of this two-bit error? Here of course, j>i.
Problem 8 Answer the following