GATEverse
← GATE CSE 2021 Set 2

Q34

MCQ2 marks, −0.67

Consider the cyclic redundancy check (CRC)\text{(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 c2c1c0c_2c_1c_0 are appended at the end of the message by the transmitter using the above CRC\text{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

Sign in to save attempts.

Loading…