Register

Search results for hamming-code

18 votes
3 answers
1
GATE CSE 2021 Set 1 | Question: 29
Assume that a $12$-bit Hamming codeword consisting of $8$-bit data and $4$ check bits is $d_8d_7d_6d_5c_8d_4d_4d_3d_2c_4d_1c_2c_1$ ... $0$ and $y$ is $1$ $x$ is $1$ and $y$ is $0$ $x$ is $1$ and $y$ is $1$
Assume that a $12$-bit Hamming codeword consisting of $8$-bit data and $4$ check bits is $d_8d_7d_6d_5c_8d_4d_4d_3d_2c_4d_1c_2c_1$, where the data bits and the check bits...
User Avatar
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
0 votes
0 answers
5
Hamming code
in reciever side to detect err which one representation we should follow to know that in which bit error is present in hamming code? p1 p2 d1 p4 d2 d3 d4 p8 d5 d6 d6 d5 p8 d4 d3 d2 p4 d1 p2 p1
in reciever side to detect err which one representation we should follow to know that in which bit error is present in hamming code?p1p2d1p4d2d3d4p8d5d6 d6d5p8d4d3d2p4d1p...
User Avatar
0 votes
1 answer
8
UGC NET CSE | October 2022 | Part 1 | Question: 55
The representation of $4$ bit code $1101$ into $7$ bit, even parity Hamming code is $(1010101)$ $(1111001)$ $(1011101)$ $(1110000)$
The representation of $4$ bit code $1101$ into $7$ bit, even parity Hamming code is$(1010101)$$(1111001)$$(1011101)$$(1110000)$
User Avatar
31 votes
7 answers
10
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
1 votes
1 answer
11
Hamming code
A 12-bit Hamming code word 000011101010 containing 8-bits of data and 4 priority bits is read from memory. What is the original 8 bit data word
A 12-bit Hamming code word 000011101010 containing 8-bits of data and 4 priority bits is read from memory.What is the original 8 bit data word
User Avatar
1 votes
1 answer
13
NIELIT Scientific Assistant A 2020 November: 82
To guarantee correction of upto $5$ errors in all cases, the minimum Hamming distance in a block code must be ______. $11$ $6$ $5$ $2$
To guarantee correction of upto $5$ errors in all cases, the minimum Hamming distance in a block code must be ______.$11$$6$$5$$2$
User Avatar
2 votes
4 answers
16
UGC NET CSE | January 2017 | Part 3 | Question: 64
Let C be a binary linear code with minimum distance $2t+1$ then it can correct upto ___ bits of error $t+1$ $t$ $t-2$ $t/2$
Let C be a binary linear code with minimum distance $2t+1$ then it can correct upto ___ bits of error$t+1$$t$$t-2$$t/2$
User Avatar
0 votes
1 answer
17
Morris Mano Edition 3 Exercise 7 Question 39 (Page No. 305)
Given that 11-bit data word 11001001010, generate the 15-bit hamming code word.
Given that 11-bit data word 11001001010, generate the 15-bit hamming code word.
User Avatar
3 votes
2 answers
18
Hamming Code
User Avatar
1 votes
0 answers
20
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
Page: