Register

Recent questions tagged error-correction

0 votes
1 answer
3
UGC NET CSE | June 2008 | Part 2 | Question: 3
If a code is t-error correcting, the minimum Hamming distance is equal to : $2 t+1$ $2 t$ $2 t-1$ $t-1$
If a code is t-error correcting, the minimum Hamming distance is equal to :$2 t+1$$2 t$$2 t-1$$t-1$
User Avatar
1 votes
0 answers
7
Morris Mano Edition 3 Exercise 7 Question 41 (Page No. 306)
How many parity check bits must be included with the data word to achieve single-bit error correction and double error correction when data words are as follows: 16 bits 32 bits 48 bits
How many parity check bits must be included with the data word to achieve single-bit error correction and double error correction when data words are as follows:16 bits...
User Avatar
1 votes
0 answers
9
Morris Mano Edition 3 Exercise 7 Question 38 (Page No. 305)
Given the 8-bit data word 01011011, generate the 13-bit composite word for the Hamming code that corrects the single bit error and detects double bit errors.
Given the 8-bit data word 01011011, generate the 13-bit composite word for the Hamming code that corrects the single bit error and detects double bit errors.
User Avatar
1 votes
1 answer
11
Parity Check Self Doubt
How many bits can a 2-dimensional parity detect and correct? Is there any general formula for no of bit detection and correction for N-dimensional parity?
How many bits can a 2-dimensional parity detect and correct? Is there any general formula for no of bit detection and correction for N-dimensional parity?
User Avatar
0 votes
0 answers
12
#CN Which protocols provide error correction in data?
TCP UDP IGMP ICMP I think ICMP can’t correct the error in data and rest three protocols can correct data errors!
TCPUDPIGMPICMPI think ICMP can’t correct the error in data and rest three protocols can correct data errors!
User Avatar
1 votes
2 answers
14
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
0 votes
1 answer
15
Hamming Method
Minimum Number of bits required to correct single bit error.
Minimum Number of bits required to correct single bit error.
User Avatar
1 votes
1 answer
16
UGC NET CSE | June 2009 | Part 2 | Question: 02
In order that a code is error correcting, the minimum Hamming distance should be : $t$ $2t - 1$ $2t$ $2t + 1$
In order that a code is error correcting, the minimum Hamming distance should be :$t$ $2t - 1$ $2t$ $2t + 1$
User Avatar
1 votes
1 answer
18
tannenbaum
Can someone plz explain this highlighted text ? I took it from Tannenbaum. thank you :)
Can someone plz explain this highlighted text ? I took it from Tannenbaum. thank you :)
User Avatar
0 votes
2 answers
19
coaching
User Avatar
0 votes
1 answer
21
Testbook
Assume x, y and z are n bit binary numbers then which of the following inequalities hold about Hamming Distance between them? A. HD(x,y)+HD(y,z)>=HD(x,z) B. HD(x,y)+HD(y,z)<=HD(x,z) C. HD(x,y) - HD(y,z)>=HD(x,z) D. None of the above
Assume x, y and z are n bit binary numbers then which of the following inequalities hold about Hamming Distance between them?A. HD(x,y)+HD(y,z)>=HD(x,z)B. HD(x,y)+HD(y,z)...
User Avatar
2 votes
1 answer
22
Tanenbaum Datalink layer Question, Hamming Code
A 12-bit Hamming code whose hexadecimal value is 0xE4F arrives at a receiver. What was the original value in hexadecimal? Assume that not more than 1 bit is in error.
A 12-bit Hamming code whose hexadecimal value is 0xE4F arrives at a receiver. What was the original value in hexadecimal? Assume that not more than 1 bit is in error.
User Avatar
2 votes
1 answer
23
UGC NET CSE | December 2011 | Part 2 | Question: 12
Start and stop bits are used in serial communications for Error detection Error correction Synchronization Slowing down the communication
Start and stop bits are used in serial communications forError detectionError correctionSynchronizationSlowing down the communication
User Avatar
1 votes
1 answer
24
UGC NET CSE | September 2013 | Part 3 | Question: 56
If the data unit is 111111 and the divisor is 1010. In CRC method, what is the dividend at the transmission before division? 1111110000 1111111010 111111000 111111
If the data unit is 111111 and the divisor is 1010. In CRC method, what is the dividend at the transmission before division?11111100001111111010111111000111111
User Avatar
4 votes
4 answers
25
ISRO2011-48
The hamming distance between the octets of $\textsf{0xAA}$ and $\textsf{0x55}$ is $7$ $5$ $8$ $6$
The hamming distance between the octets of $\textsf{0xAA}$ and $\textsf{0x55}$ is$7$$5$$8$$6$
User Avatar
0 votes
1 answer
28
Peterson Davie 2.13
Show that two-dimensional parity provides the receiver enough information to correct any $1$-bit error (assuming the receiver knows only $1$ bit is bad), but not any $2$-bit error.
Show that two-dimensional parity provides the receiver enough information to correct any $1$-bit error (assuming the receiver knows only $1$ bit is bad), but not any $2$-...
User Avatar
To see more, click for the full list of questions or popular tags.