Register

Recent questions tagged error-detection

0 votes
1 answer
31
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
User Avatar
1 votes
2 answers
32
UGC NET CSE | July 2018 | Part 2 | Question: 49
To guarantee correction of upto $t$ errors, the minimum Hamming distance $d_{min}$ in a block code must be ______ $t+1$ $t-2$ $2t-1$ $2t+1$
To guarantee correction of upto $t$ errors, the minimum Hamming distance $d_{min}$ in a block code must be ______$t+1$$t-2$$2t-1$$2t+1$
User Avatar
1 votes
1 answer
33
Error detection
Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto _____ bits of error. A t + 1 B t C t - 2 D t / 2
Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto _____ bits of error.At + 1BtCt - 2Dt / 2
User Avatar
5 votes
1 answer
37
Computer Networks: Bit Stuffing
Flag: 01111110 Data: 1000111111100111110100011111111111000011111 bit stuff the given data?
Flag: 01111110Data: 1000111111100111110100011111111111000011111bit stuff the given data?
User Avatar
0 votes
2 answers
39
coaching
User Avatar
6 votes
2 answers
43
ISRO2011-50
Data is transmitted continuously at $2.048$ Mbps rate for $10$ hours and received $512$ bits errors. What is the bit error rate? $\text{6.9 e-9}$ $\text{6.9 e-6}$ $\text{69 e-9}$ $\text{4 e-9}$
Data is transmitted continuously at $2.048$ Mbps rate for $10$ hours and received $512$ bits errors. What is the bit error rate?$\text{6.9 e-9}$$\text{6.9 e-6}$$\text{69 ...
User Avatar
7 votes
4 answers
44
ISRO2008-79
Repeated execution of simple computation may cause compounding of round-off errors syntax errors run-time errors logic errors
Repeated execution of simple computation may cause compounding ofround-off errorssyntax errorsrun-time errorslogic errors
User Avatar
2 votes
2 answers
45
ISI2013-PCB-CS-6a
A block of bits with $n$ rows and $m$ columns uses horizontal and vertical parity bits for error detection. If exactly 4 bits are in error during transmission, derive an expression for the probability that the error will be detected.
A block of bits with $n$ rows and $m$ columns uses horizontal and vertical parity bits for error detection. If exactly 4 bits are in error during transmission, derive an ...
User Avatar
2 votes
5 answers
47
ISRO-2013-18
How many check bits are required for $16$ bit data word to detect $2$ bit errors and single bit correction using hamming code? $5$ $6$ $7$ $8$
How many check bits are required for $16$ bit data word to detect $2$ bit errors and single bit correction using hamming code?$5$$6$$7$$8$
User Avatar
2 votes
1 answer
48
Parity Bit
How many parity bits will be required for transmitting a 16-bit data ? a 6 b 3 c 2 d 1
How many parity bits will be required for transmitting a 16-bit data ?a 6 b 3 c 2 d 1
User Avatar
39 votes
7 answers
51
GATE IT 2007 | Question: 43
An error correcting code has the following code words: $00000000, 00001111, 01010101, 10101010, 11110000$. What is the maximum number of bit errors that can be corrected? $0$ $1$ $2$ $3$
An error correcting code has the following code words: $00000000, 00001111, 01010101, 10101010, 11110000$. What is the maximum number of bit errors that can be corrected?...
User Avatar
25 votes
5 answers
53
GATE CSE 1995 | Question: 1.12
What is the distance of the following code $000000$, $010101$, $000111$, $011001$, $111111$? $2$ $3$ $4$ $1$
What is the distance of the following code $000000$, $010101$, $000111$, $011001$, $111111$?$2$$3$$4$$1$
User Avatar
31 votes
7 answers
54
GATE CSE 1994 | Question: 9
Following $7$ ... that at most $1$ bit could be corrupted). If the message contains an error find the bit which is erroneous and gives correct message.
Following $7$ bit single error correcting hamming coded message is received.$$\overset{7\qquad 6\qquad 5 \qquad 4\qquad 3 \qquad 2 \qquad 1}{\boxed{1 \qquad 0\qquad 0 \qq...
User Avatar
48 votes
7 answers
55
GATE CSE 2014 Set 3 | Question: 24
A bit-stuffing based framing protocol uses an $\text{8-bit}$ delimiter pattern of $01111110.$ If the output bit-string after stuffing is $01111100101,$ then the input bit-string is: $0111110100$ $0111110101$ $0111111101$ $0111111111$
A bit-stuffing based framing protocol uses an $\text{8-bit}$ delimiter pattern of $01111110.$ If the output bit-string after stuffing is $01111100101,$ then the input bit...
User Avatar
27 votes
4 answers
57
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...
User Avatar
Page: