27 votes 27 votes The message $11001001$ is to be transmitted using the CRC polynomial $x^3 +1$ to protect it from errors. The message that should be transmitted is: $11001001000$ $11001001011$ $11001010$ $110010010011$ Computer Networks gatecse-2007 computer-networks error-detection crc-polynomial normal isro2016 + – Kathleen asked Sep 21, 2014 • edited Jun 15, 2018 by Pooja Khatri Kathleen 34.0k views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply अनुराग पाण्डेय commented Jan 14, 2016 reply Follow Share CRC Calculation 14 votes 14 votes Praveen Ranjan Keshr commented Jan 21, 2016 reply Follow Share How come 1100-1001 is 101? Should it not be 11? 0 votes 0 votes rishabhsharma commented Jun 1, 2020 reply Follow Share https://www.geeksforgeeks.org/error-detection-in-computer-networks/ 2 votes 2 votes Rishank commented Jun 2, 2022 reply Follow Share We are not doing division of binary numbers, we are doing XOR operation. XOR of 1100 and 1001 is 101 0 votes 0 votes Please log in or register to add a comment.
Best answer 55 votes 55 votes Answer - B. Degree of generator polynomial is $3$ hence $3\text{-bits}$ are appended before performing division After performing division using $2's$ complement arithmetic remainder is $011$ The remainder is appended to original data bits and we get $M' = 11001001\bf{011}$ from $M = 11001001.$ Courtesy, Anurag Pandey ankitrokdeonsns answered Feb 2, 2015 • edited Jun 13, 2021 by S k Rawani ankitrokdeonsns comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments Pratik Gawali commented Dec 10, 2018 reply Follow Share Polynomial function is $x^{3}$ +1 It can be interpreted as 1$x^{3}$ + 0$x^{2}$ + 0$x^{1} + 1$$x^{0}$ Considering all the coefficients: 1001 is the required divisor. 1 votes 1 votes Harshada commented Jan 1, 2019 reply Follow Share @Sumaiya23 Since the degree of CRC polynomial is 3 that's why 3 bits are appended. 1 votes 1 votes Apoorva Jain commented Jan 11, 2019 reply Follow Share In polynmial method , We continue to divide until degree of rmainder is less than degree of divisor => x3 degree 3 so remainder of the form x2 + x + 1 , hence 3 bits. 0 votes 0 votes Please log in or register to add a comment.
–4 votes –4 votes 110011 011 where 011 is crc Sakshi Popli Chopra answered Dec 4, 2016 Sakshi Popli Chopra comment Share Follow See all 0 reply Please log in or register to add a comment.
–5 votes –5 votes Answer is d the no. Of bits u add for n degree poly is n+ 1 anshu answered Jan 30, 2015 anshu comment Share Follow See all 0 reply Please log in or register to add a comment.
–10 votes –10 votes ans a) Aditi Dan answered Dec 23, 2014 Aditi Dan comment Share Follow See all 3 Comments See all 3 3 Comments reply Keith Kr commented Jan 24, 2015 reply Follow Share Can you please give detailed explanation? 0 votes 0 votes Puja Mishra commented Jan 31, 2017 reply Follow Share seriously she does nt explain anything.... 1 votes 1 votes Mudit Maheshwari commented Apr 27, 2017 reply Follow Share how are you xoring 1011 with 1001 such that you are taking in the next step 1001? 0 votes 0 votes Please log in or register to add a comment.