Search results for crc-polynomial / GATE Overflow for GATE CSE

27 votes

4 answers

1

GATE CSE 2007 | Question: 68, ISRO2016-73
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$

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$$110010010...

Kathleen

34.1k views

Kathleen asked Sep 21, 2014

0 votes

0 answers

2

#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

181 views

Ansh Sinha asked Jan 7

4 votes

1 answer

3

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

1.2k views

GO Classes asked Mar 26, 2023

0 votes

1 answer

4

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

34.8k views

ajaysoni1924 asked Mar 16, 2019

1 votes

1 answer

5

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

628 views

admin asked Dec 15, 2022

1 votes

1 answer

6

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

626 views

admin asked Dec 15, 2022

0 votes

2 answers

7

CRC

Manpreet Saluja

460 views

Manpreet Saluja asked Oct 31, 2022

9 votes

2 answers

8

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.4k views

Arjun asked Feb 18, 2021

27 votes

3 answers

9

GATE IT 2005 | Question: 78
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$

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$...

Ishrat Jahan

20.1k views

Ishrat Jahan asked Nov 3, 2014

0 votes

0 answers

10

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

611 views

Divyanshu Shukla asked Nov 26, 2021

1 votes

1 answer

11

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

512 views

gatecse asked Dec 9, 2020

2 votes

1 answer

12

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.8k views

ajaysoni1924 asked Mar 16, 2019

1 votes

1 answer

13

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

34 votes

3 answers

14

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.8k views

Arjun asked Feb 14, 2017

2 votes

2 answers

15

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

0 votes

2 answers

16

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

4 votes

2 answers

17

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.9k views

makhdoom ghaya asked Oct 1, 2016

2 votes

1 answer

18

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.1k views

superak96 asked Feb 7, 2019

0 votes

0 answers

19

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

598 views

ajaysoni1924 asked Mar 16, 2019

0 votes

0 answers

20

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

310 views

s_dr_13 asked Mar 6, 2019

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