27 votes 27 votes Consider the following message $M = 1010001101$. The cyclic redundancy check (CRC) for this message using the divisor polynomial $x^5+x^4+x^2+1$ is : $01110$ $01011$ $10101$ $10110$ Computer Networks gateit-2005 computer-networks crc-polynomial normal + – Ishrat Jahan asked Nov 3, 2014 • edited Jun 15, 2018 by Pooja Khatri Ishrat Jahan 20.3k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 53 votes 53 votes Degree of generator polynomial is $5.$ Hence, $5$ zeroes are appended before division. In CRC calculation, we add the remainder to the original message to get $M'= 1010001101\bf{01110}.$ Answer is A. kvkumar answered May 25, 2016 • edited Jun 13, 2021 by Arjun kvkumar comment Share Follow See all 2 Comments See all 2 2 Comments reply talha hashim commented Sep 25, 2018 reply Follow Share behtareen explanation bhaijaan 1 votes 1 votes s_dr_13 commented Oct 5, 2020 i edited by JAINchiNMay Sep 14, 2022 reply Follow Share Thanks for your answer !! PS which software did you used to write ? 0 votes 0 votes Please log in or register to add a comment.
14 votes 14 votes Answer: A Divide 101000110100000 by 110101 to get 01110 as remainder. And as we know, remainder is the CRC. Rajarshi Sarkar answered Apr 9, 2015 Rajarshi Sarkar comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes The image below shows the answer which is 1110 or you can also say 01110 shashankrustagi answered Aug 6, 2020 shashankrustagi comment Share Follow See all 0 reply Please log in or register to add a comment.