The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged crcpolynomial
0
votes
0
answers
1
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 18 (Page No. 253)
A 1024bit message is sent that contains 992 data bits and 32 CRC bits. CRC is computed using the IEEE 802 standardized, 32degree CRC polynomial. For each of the following, explain whether the errors during message transmission will be ... . (e) There was a 24bit long burst error. (f) There was a 35bit long burst error.
asked
Mar 16
in
Computer Networks
by
ajaysoni1924
Boss
(
10.5k
points)

39
views
computernetworks
datalinklayer
tanenbaum
crcpolynomial
errordetection
+1
vote
1
answer
2
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 16 (Page No. 253)
What is the remainder obtained by dividing $x^7 + x ^5 + 1$ by the generator polynomial $x^ 3 + 1?$
asked
Mar 16
in
Computer Networks
by
ajaysoni1924
Boss
(
10.5k
points)

26
views
computernetworks
tanenbaum
errordetection
datalinklayer
crcpolynomial
0
votes
0
answers
3
Networking
Can anyone please explain why do we need x+1 to be a factor of G(x).ie generator polynomial to detect odd no of bit errors ??
asked
Mar 6
in
Computer Networks
by
s_dr_13
(
167
points)

24
views
crcpolynomial
+2
votes
1
answer
4
Error Detection Using CRC
For detecting a single bit error using CRC, it is needed that $x^{i}$ should not be divisible by g(x). So, we make g(x) of at least 2 terms, which renders a single term of e(x) indivisible. But then what is the logic behind keeping MSB as 1. ... any single bit indivisible? For example, $x^{3}+x^{2}$ is guarantees to detect a single bit error at any position. Is it not?
asked
Feb 7
in
Computer Networks
by
superak96
(
261
points)

151
views
crcpolynomial
crc
computernetworks
errordetection
singlebiterror
+1
vote
1
answer
5
CNGATEBOOK
I think for (C), it should be The probability of "not detecting" a burst error of size 9 is $\frac{1}{2^7}$ And for (D), the probability of detecting burst error of size 15 should be $1\frac{1}{2^8}$ Correct me if I am wrong.
asked
Nov 9, 2018
in
Computer Networks
by
Ayush Upadhyaya
Boss
(
27.1k
points)

117
views
computernetworks
crcpolynomial
0
votes
1
answer
6
self doubt
CRC can detect any odd number of errors. CRC can detect all burst errors of less than the degree of the polynomial. Please explain and if possible give proof
asked
Oct 15, 2018
in
Computer Networks
by
Vegeta
Junior
(
835
points)

55
views
crcpolynomial
computernetworks
errordetection
0
votes
0
answers
7
CRC Tanenbaum
A bit stream 10011101 is transmitted using the standard CRC method described in the text. The generator polynomial is x ^3 + 1. Suppose that the third bit from the left is inverted during transmission.. Give an example of bit errors in the bit string transmitted that will not be detected by the receiver.
asked
Sep 3, 2018
in
Computer Networks
by
Na462
Loyal
(
6.8k
points)

97
views
computernetworks
crcpolynomial
tanenbaum
0
votes
1
answer
8
question,
In CRC, if the degree of Generator polynomial is n, then the number of bits in divisor is?
asked
Dec 30, 2017
in
Computer Networks
by
AnilGoudar
Active
(
4.3k
points)

140
views
crcpolynomial
computernetworks
0
votes
1
answer
9
CRC checking
Let G(x) be the generator polynomial used for CRC checking. What is the condition that should be satisfied by G(x) to detect all isolated double errors? G(x) should have at least two terms. G(x) should have the factor x+1 G(X) shouldn’t divide xt+1 (for t less than frame length The coefficient of the term x0 should be 1.
asked
Oct 25, 2017
in
Computer Networks
by
shivangi5
Active
(
1.1k
points)

288
views
computernetworks
crcpolynomial
+4
votes
1
answer
10
CN: CRC Rules
From forouzan : If the generator has more than one term and coefficient of x^0 is 1 then all single bit error can be caught. So if e(x)=x^i // means some power of 2 number g(x) = at least two terms and coefficient of x^0 is always 1, means some odd number. So is it saying that the number some 2^i will never be divisible by odd number?
asked
Aug 18, 2017
in
Computer Networks
by
rahul sharma 5
Boss
(
25.1k
points)

152
views
computernetworks
crcpolynomial
+20
votes
3
answers
11
GATE2017132
A computer network uses polynomials over $GF(2)$ for error checking with $8$ bits as information bits and uses $x^{3}+x+1$ as the generator polynomial to generate the check bits. In this network, the message $01011011$ is transmitted as: $01011011010$ $01011011011$ $01011011101$ $01011011100$
asked
Feb 14, 2017
in
Computer Networks
by
Arjun
Veteran
(
422k
points)

3.3k
views
gate20171
computernetworks
crcpolynomial
normal
+2
votes
1
answer
12
UGCNETDec2013III33
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 110010011001 11001001 110010011001001 11001001011
asked
Jul 28, 2016
in
Computer Networks
by
jothee
Veteran
(
104k
points)

812
views
ugcnetdec2013iii
computernetworks
crcpolynomial
+1
vote
2
answers
13
CN CRCChecksum
Why don't we use CRC in IP header instead of Checksum?
asked
Jul 21, 2016
in
Computer Networks
by
erh
Active
(
1.4k
points)

292
views
computernetworks
crcpolynomial
header
+9
votes
1
answer
14
ISRO201552
In CRC if the data unit is 100111001 and the divisor is 1011 then what is dividend at the receiver? 100111001101 100111001011 100111001 100111001110
asked
Jun 19, 2016
in
Computer Networks
by
jothee
Veteran
(
104k
points)

2.4k
views
isro2015
computernetworks
crcpolynomial
+3
votes
4
answers
15
ISI2015PCBCS4a
Consider the use of Cyclic Redundancy Code (CRC) with generator polynomial $G(x)$ for error detection. Recall that error detection with a CRC works by appending the CRC value to the bit sequence to make it a multiple of $G(x)$. Calculate the CRC value of the bit ... burst error of length $5$ in such a way that the error cannot be detected by the CRC with the $G(x)$ given above.
asked
May 29, 2016
in
Computer Networks
by
jothee
Veteran
(
104k
points)

778
views
descriptive
isi2015pcbcs
computernetworks
errordetection
crcpolynomial
0
votes
0
answers
16
crc
asked
May 21, 2016
in
Computer Networks
by
Sourabh Kumar
Active
(
1.5k
points)

313
views
crcpolynomial
+4
votes
1
answer
17
ISRO201340
If the frame to be transmitted is $1101011011$ and the CRC polynomial to be used for generating checksum is $x^{4}+x+1$, than what is the transmitted frame? $11010110111011$ $11010110111101$ $11010110111110$ $11010110111001$
asked
Apr 27, 2016
in
Computer Networks
by
makhdoom ghaya
Boss
(
29.9k
points)

3.1k
views
isro2013
computernetworks
crcpolynomial
0
votes
1
answer
18
Patterson Chap 2 Q 18
18. Suppose we want to transmit the message 11100011 and protect it from errors using the CRC polynomial x3 + 1. (a) Use polynomial long division to determine the message that should be transmitted. (b) Suppose the leftmost bit of the message is ... link. What is the result of the receiver’s CRC calculation? How does the receiver know that an error has occurred?
asked
Dec 15, 2015
in
Computer Networks
by
Akash Kanase
Boss
(
41.4k
points)

405
views
referencebook
computernetworks
crcpolynomial
0
votes
3
answers
19
Patterson Chap 2 Q 19
19. Suppose we want to transmit the message 1011 0010 0100 1011 and protect it from errors using the CRC8 polynomial x8+ x2+ x1 + 1. (a) Use polynomial long division to determine the message that should be transmitted. (b) Suppose the leftmost ... link. What is the result of the receiver’s CRC calculation? How does the receiver know that an error has occurred?
asked
Dec 15, 2015
in
Computer Networks
by
Akash Kanase
Boss
(
41.4k
points)

746
views
computernetworks
referencebook
difficult
crcpolynomial
+1
vote
1
answer
20
CRC can detect all bursts of upto m errors if generator polynomial G(x) is of degree?
asked
Jan 22, 2015
in
Computer Networks
by
Vikrant Singh
Boss
(
13.5k
points)

460
views
crcpolynomial
computernetworks
+20
votes
3
answers
21
GATE2005IT78
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$
asked
Nov 4, 2014
in
Computer Networks
by
Ishrat Jahan
Boss
(
16.3k
points)

2.3k
views
gate2005it
computernetworks
crcpolynomial
normal
+17
votes
4
answers
22
GATE200768, ISRO201673
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$
asked
Sep 22, 2014
in
Computer Networks
by
Kathleen
Veteran
(
52.1k
points)

7k
views
gate2007
computernetworks
errordetection
crcpolynomial
normal
isro2016
To see more, click for the
full list of questions
or
popular tags
.
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
TIFR and JEST exam
Minimal Deterministic Finite Automata
To be aware of fake GATE test series
Standard Book Exercise Questions for Computer Science
Resource to Learn Graph Theory Interactively
Follow @csegate
Recent questions tagged crcpolynomial
Recent Blog Comments
JEST papers are not available online. for TIFR...
Are previous year question papers available,...
For JEST, applied for phd or integrated phd...
Thank you, Lakshman. Keep up the good work.
Is NOC need to send via registered post only? Or...
50,666
questions
56,136
answers
193,704
comments
93,485
users