Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged crc-polynomial
0
votes
0
answers
1
#selfdoubt
In CRC, if the dataword is 5 bits and the codeword is 8 bits, how many 0s need to be added to the dataword to make the dividend? What is the size of the remainder? What is the size of the divisor?
In CRC, if the dataword is 5 bits and the codeword is 8 bits, how many 0s need to be added to the dataword to make the dividend? What is the size of the remainder? What i...
Ansh Sinha
142
views
Ansh Sinha
asked
Jan 7
Computer Networks
computer-networks
self-doubt
crc-polynomial
+
–
3
votes
1
answer
2
GO Classes 2023 | IIITH Mock Test 1 | Question: 49
Let $\text{CRC}$ generator polynomial $\text{G}(x)=1+x$. Which of the following errors $\text{E}(x)$ will be detected by $\text{G}(x)?$ $\text{E}(x)=x^{12}+x^{11}+x^3+x^2+x+1$ $\text{E}(x)=x^{36}+x^5+1$ $\text{E}(x)=x^{17}+x^5 $ $\text{E}(x)=x^{11}+x^2+1$
Let $\text{CRC}$ generator polynomial $\text{G}(x)=1+x$.Which of the following errors $\text{E}(x)$ will be detected by $\text{G}(x)?$$\text{E}(x)=x^{12}+x^{11}+x^3+x^2+x...
GO Classes
928
views
GO Classes
asked
Mar 26, 2023
Computer Networks
goclasses2023-iiith-mock-1
goclasses
computer-networks
crc-polynomial
multiple-selects
1-mark
+
–
1
votes
1
answer
3
DRDO CSE 2022 Paper 2 | Question: 18
For the following two $16$-bit messages, find the Internet checksum: $0001 \; 1000 \; 0001 \; 0010$ $1011 \; 1000 \; 1011 \; 0011$
For the following two $16$-bit messages, find the Internet checksum:$0001 \; 1000 \; 0001 \; 0010$$1011 \; 1000 \; 1011 \; 0011$
admin
582
views
admin
asked
Dec 15, 2022
Computer Networks
drdocse-2022-paper2
computer-networks
crc-polynomial
3-marks
descriptive
+
–
1
votes
1
answer
4
DRDO CSE 2022 Paper 2 | Question: 19
Both the payload and $2\text{D}$ (even) parity bits are shown below. Some of these bit(s) have been flipped. Indicate the row and column of the flipped bit(s) in format (col, row); e.g., top left bit is $(0,0)$. \[\begin{array}{l} 1000 \; 0001 \; 1111 \; ... 0100 \; 0011 \; 0011 \text { | } 0 \\ \overline{0110 \;0111\; 0101\; 1001 \text { | } 1} \\ \end{array}\]
Both the payload and $2\text{D}$ (even) parity bits are shown below. Some of these bit(s) have been flipped. Indicate the row and column of the flipped bit(s) in format (...
admin
574
views
admin
asked
Dec 15, 2022
Computer Networks
drdocse-2022-paper2
computer-networks
crc-polynomial
3-marks
descriptive
+
–
0
votes
2
answers
5
CRC
Manpreet Saluja
432
views
Manpreet Saluja
asked
Oct 31, 2022
Computer Networks
crc-polynomial
+
–
0
votes
0
answers
6
Forouzan Error Detection and correction Example 10.16
Find the status of the following generators related to two isolated, single-bit errors. a. $x + 1$ b. $x^4+1$ c. $x² + x + 1$ d. $x^{14}+x^{15}+1$
Find the status of the following generators related to two isolated, single-bit errors.a. $x + 1$b. $x^4+1$c. $x² + x + 1$d. $x^{14}+x^{15}+1$
Divyanshu Shukla
573
views
Divyanshu Shukla
asked
Nov 26, 2021
Computer Networks
forouzan
computer-networks
crc-polynomial
+
–
9
votes
2
answers
7
GATE CSE 2021 Set 2 | Question: 34
Consider the cyclic redundancy check $\text{(CRC)}$ based error detecting scheme having the generator polynomial $X^3+X+1$. Suppose the message $m_4m_3m_2m_1m_0=11000$ is to be transmitted. Check bits $c_2c_1c_0$ are appended at the end of the ... is denoted by $m_4m_3m_2m_1m_0c_2c_1c_0$. The value of the checkbit sequence $c_2c_1c_0$ is $101$ $110$ $100$ $111$
Consider the cyclic redundancy check $\text{(CRC)}$ based error detecting scheme having the generator polynomial $X^3+X+1$. Suppose the message $m_4m_3m_2m_1m_0=11000$ is...
Arjun
6.2k
views
Arjun
asked
Feb 18, 2021
Computer Networks
gatecse-2021-set2
computer-networks
crc-polynomial
2-marks
+
–
1
votes
1
answer
8
NIELIT Scientific Assistant A 2020 November: 120
In $\text{CRC}$ calculation if divisor is $1011$, and dataword is $1001$ what will be the $\text{CRC}$? $111$ $101$ $110$ $100$
In $\text{CRC}$ calculation if divisor is $1011$, and dataword is $1001$ what will be the $\text{CRC}$?$111$$101$$110$$100$
gatecse
498
views
gatecse
asked
Dec 9, 2020
Computer Networks
nielit-sta-2020
computer-networks
crc-polynomial
+
–
0
votes
3
answers
9
UGC NET CSE | January 2017 | Part 3 | Question: 27
Let $G(x)$ be generator polynomial used for CRC checking. The condition that should be satisfied by $G(x)$ to correct odd numbered error bits, will be: $(1+x)$ is factor of $G(x)$ $(1-x)$ is factor of $G(x)$ $(1+x^{2})$ is factor of $G(x)$ $x$ is factor of $G(x)$
Let $G(x)$ be generator polynomial used for CRC checking. The condition that should be satisfied by $G(x)$ to correct odd numbered error bits, will be:$(1+x)$ is factor o...
go_editor
1.3k
views
go_editor
asked
Mar 24, 2020
Computer Networks
ugcnetcse-jan2017-paper3
computer-networks
crc-polynomial
+
–
0
votes
0
answers
10
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 39 (Page No. 255)
The goal of this lab exercise is to implement an error-detection mechanism using the standard CRC algorithm described in the text. Write two programs, generator and verifier. The generator program reads from standard input a ... correct, but by typing generator <file | alter arg | verifier you should get the error message.
The goal of this lab exercise is to implement an error-detection mechanism using thestandard CRC algorithm described in the text. Write two programs, generator andverifie...
ajaysoni1924
579
views
ajaysoni1924
asked
Mar 16, 2019
Computer Networks
computer-networks
data-link-layer
tanenbaum
error-detection
crc-polynomial
programming
+
–
1
votes
1
answer
11
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 18 (Page No. 253)
A 1024-bit message is sent that contains 992 data bits and 32 CRC bits. CRC is computed using the IEEE 802 standardized, 32-degree CRC polynomial. For each of the following, explain whether the errors during message transmission will be ... . (e) There was a 24-bit long burst error. (f) There was a 35-bit long burst error.
A 1024-bit message is sent that contains 992 data bits and 32 CRC bits. CRC is computedusing the IEEE 802 standardized, 32-degree CRC polynomial. For each of thefollowing...
ajaysoni1924
1.8k
views
ajaysoni1924
asked
Mar 16, 2019
Computer Networks
computer-networks
data-link-layer
tanenbaum
crc-polynomial
error-detection
+
–
0
votes
1
answer
12
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 17 (Page No. 253)
A bit stream 10011101 is transmitted using the standard CRC method described in the text. The generator polynomial is x 3 + 1. Show the actual bit string transmitted. Suppose that the third bit from the left is inverted ... . Give an example of bit errors in the bit string transmitted that will not be detected by the receiver.
A bit stream 10011101 is transmitted using the standard CRC method described in thetext. The generator polynomial is x 3 + 1. Show the actual bit string transmitted. Supp...
ajaysoni1924
33.3k
views
ajaysoni1924
asked
Mar 16, 2019
Computer Networks
computer-networks
tanenbaum
crc-polynomial
error-detection
data-link-layer
+
–
2
votes
1
answer
13
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?$
What is the remainder obtained by dividing $x^7 + x ^5 + 1$ by the generator polynomial $x^ 3 + 1?$
ajaysoni1924
10.5k
views
ajaysoni1924
asked
Mar 16, 2019
Computer Networks
computer-networks
tanenbaum
error-detection
data-link-layer
crc-polynomial
+
–
0
votes
0
answers
14
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 ??
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 ??
s_dr_13
296
views
s_dr_13
asked
Mar 6, 2019
Computer Networks
crc-polynomial
+
–
2
votes
1
answer
15
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?
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 o...
superak96
1.0k
views
superak96
asked
Feb 7, 2019
Computer Networks
crc-polynomial
computer-networks
error-detection
single-bit-error
+
–
2
votes
2
answers
16
NIELIT 2018-79
Given message $M=1010001101$. The CRC for this given message using the divisor polynomial $x^5+x^4+x^2+1$ is ______ $01011$ $10101$ $01110$ $10110$
Given message $M=1010001101$. The CRC for this given message using the divisor polynomial $x^5+x^4+x^2+1$ is ______$01011$$10101$$01110$$10110$
Arjun
2.3k
views
Arjun
asked
Dec 7, 2018
Computer Networks
nielit-2018
computer-networks
crc-polynomial
+
–
1
votes
1
answer
17
CN-GATEBOOK
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.
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 1...
Ayush Upadhyaya
1.1k
views
Ayush Upadhyaya
asked
Nov 9, 2018
Computer Networks
computer-networks
crc-polynomial
+
–
0
votes
1
answer
18
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
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
Vegeta
740
views
Vegeta
asked
Oct 15, 2018
Computer Networks
crc-polynomial
computer-networks
error-detection
+
–
0
votes
0
answers
19
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.
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 i...
Na462
675
views
Na462
asked
Sep 3, 2018
Computer Networks
computer-networks
crc-polynomial
tanenbaum
+
–
2
votes
1
answer
20
ISRO2018-11
________ can detect burst error of length less than or equal to degree of the polynomial and detects burst errors that affect odd number of bits. Hamming Code CRC VRC None of the above
________ can detect burst error of length less than or equal to degree of the polynomial and detects burst errors that affect odd number of bits.Hamming CodeCRCVRCNone of...
Arjun
3.9k
views
Arjun
asked
Apr 22, 2018
Computer Networks
isro2018
computer-networks
crc-polynomial
+
–
0
votes
2
answers
21
question,
In CRC, if the degree of Generator polynomial is n, then the number of bits in divisor is?
In CRC, if the degree of Generator polynomial is n, then the number of bits in divisor is?
AnilGoudar
1.6k
views
AnilGoudar
asked
Dec 30, 2017
Computer Networks
crc-polynomial
computer-networks
+
–
0
votes
1
answer
22
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.
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 a...
shivangi5
2.3k
views
shivangi5
asked
Oct 25, 2017
Computer Networks
computer-networks
crc-polynomial
+
–
4
votes
1
answer
23
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?
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...
rahul sharma 5
1.1k
views
rahul sharma 5
asked
Aug 17, 2017
Computer Networks
computer-networks
crc-polynomial
+
–
34
votes
3
answers
24
GATE CSE 2017 Set 1 | Question: 32
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$
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 che...
Arjun
11.6k
views
Arjun
asked
Feb 14, 2017
Computer Networks
gatecse-2017-set1
computer-networks
crc-polynomial
normal
+
–
4
votes
2
answers
25
UGC NET CSE | August 2016 | Part 3 | Question: 27
In CRC checksum method, assume that given frame for transmission is 1101011011 and the generator polynomial is $G(x) = x^{4}+ x + 1$. After implementing $CRC$ encoder, the encoded word sent from sender side is _____. 11010110111110 11101101011011 110101111100111 110101111001111
In CRC checksum method, assume that given frame for transmission is 1101011011 and the generator polynomial is $G(x) = x^{4}+ x + 1$. After implementing $CRC$ encoder, th...
makhdoom ghaya
16.6k
views
makhdoom ghaya
asked
Oct 1, 2016
Computer Networks
ugcnetcse-aug2016-paper3
computer-networks
crc-polynomial
checksum
+
–
2
votes
1
answer
26
UGC NET CSE | December 2015 | Part 3 | Question: 31
In CRC based design, a CRC Team consists of one or two users representatives several programmers project co-ordinators one or two system analysts $\text{i and iii}$ $\text{i, ii, iii and iv}$ $\text{i, iii, and iv}$ $\text{i, ii, and iv}$
In CRC based design, a CRC Team consists ofone or two users representativesseveral programmersproject co-ordinatorsone or two system analysts$\text{i and iii}$$\text{i, i...
go_editor
1.9k
views
go_editor
asked
Aug 10, 2016
IS&Software Engineering
ugcnetcse-dec2015-paper3
is&software-engineering
crc-polynomial
+
–
3
votes
1
answer
27
UGC NET CSE | December 2013 | Part 3 | Question: 33
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
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 is110010011001110010011100...
go_editor
2.5k
views
go_editor
asked
Jul 28, 2016
Computer Networks
ugcnetcse-dec2013-paper3
computer-networks
crc-polynomial
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register