Consider the cyclic redundancy check (CRC) based error detecting scheme having…

GATE · 2021 · CS · Set 2 · Computer Science & IT

Consider the cyclic redundancy check (CRC) based error detecting scheme having the generator polynomial X3+X+1X^3+X+1. Suppose the message m4m3m2m1m0=11000m_4m_3m_2m_1m_0 = 11000  is to be transmitted. Check bits c2c1c0 are appended at the end of the message by the transmitter using the above CRC scheme. The transmitted bit string is denoted by m4m3m2m1m0c2c1c0m_4m_3m_2m_1m_0c_2c_1c_0. The value of the checkbit sequence c2c1c0c_2c_1c_0 is

  1. A.

    101

  2. B.

    110

  3. C.

    100

  4. D.

    111

Attempted by 358 students.

Sign up free to check your answer

Sign up free

Explore the full course: Isro

Loading lesson…