Consider the cyclic redundancy check (CRC) based error detecting scheme having the generator polynomial $X^3 + X + 1$. Suppose the message $m_4 m_3 m_2 m_1 m_0 = 11000$ is to be transmitted. Check bits $c_2 c_1 c_0$ are appended at the end of the message by the transmitter using the above CRC scheme. The transmitted bit string is denoted by $m_4 m_3 m_2 m_1 m_0 c_2 c_1 c_0$. The value of the checkbit sequence $c_2 c_1 c_0$ is

Consider the cyclic redundancy check (CRC) based error detecting scheme having the generator polynomial X3 + X + 1. Suppose the message m4 m3 m2 m1 m0 = 11000 is to be transmitted. Check bits c2 c1 c0 are appended at the end of the message by the transmitter using the above CRC scheme. The transmitted bit string is denoted by m4 m3 m2 m1 m0 c2 c1 c0. The value of the checkbit sequence c2 c1 c0 is

Topic-wise GATE CS PYQs with verified steps