search
Log In

Recent questions tagged hamming-code

1 vote
1 answer
1
Consider a code with only four valid code words: $0000000000$, $0000011111$, $1111100000$, and $1111111111$. This code has distance $5$. If the code word arrived is $0000000111$ then the original code word must be _______ $0000011111$ $0000000000$ $1111100000$ $1111111111$
asked Nov 20, 2020 in Computer Networks jothee 97 views
0 votes
0 answers
2
It is necessary to formulate the hamming code for four data bits $D _3, D _5, D _6 and D _7$ together with three parity bits $P _1, P _2 and P _3$ ... to include the double bit error detection in the code. Assume that error occurs in the bit $D _5 and P _2$. Show how the error is detected.
asked Apr 6, 2019 in Digital Logic ajaysoni1924 244 views
0 votes
0 answers
3
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
asked Apr 6, 2019 in Digital Logic ajaysoni1924 992 views
1 vote
0 answers
4
A 12-bit hamming code word 8-bits of data and 4 parity bits are read from the memory. What was the original 8-bit data word that was written into the memory if the 12-bits word read out are as follows: 000011101010 101110000110 101111110100
asked Apr 6, 2019 in Digital Logic ajaysoni1924 325 views
0 votes
1 answer
5
0 votes
0 answers
6
0 votes
1 answer
7
Suppose that data are transmitted in blocks of sizes 1000 bits. What is the maximum error rate under which error detection and retransmission mechanism (1 parity bit per block) is better than using Hamming code? Assume that bit errors are independent of one another and no bit error occurs during retransmission.
asked Mar 16, 2019 in Computer Networks ajaysoni1924 269 views
1 vote
0 answers
8
0 votes
1 answer
9
Sixteen-bit messages are transmitted using a Hamming code. How many check bits are needed to ensure that the receiver can detect and correct single-bit errors? Show the bit pattern transmitted for the message 1101001100110101. Assume that even parity is used in the Hamming code.
asked Mar 16, 2019 in Computer Networks ajaysoni1924 205 views
1 vote
0 answers
10
To provide more reliability than a single parity bit can give, an error-detecting coding scheme uses one parity bit for checking all the odd-numbered bits and a second parity bit for all the even-numbered bits. What is the Hamming distance of this code?
asked Mar 16, 2019 in Computer Networks ajaysoni1924 294 views
0 votes
0 answers
11
0 votes
1 answer
13
someone please post detailed solution pic for this procedure- I am getting bits 1 and 2 as errorneous.
asked Jan 9, 2019 in Computer Networks Markzuck 653 views
2 votes
2 answers
14
If the Hamming distance between a dataword and the corresponding codeword is three, there are _____ bits in error. A) 5 B) 4 C) 3 D) none of the above
asked Nov 19, 2018 in Computer Networks iarnav 624 views
0 votes
2 answers
15
Consider a binary channel code in which each codeword has a fixed length of 5 bits. The Hamming distance between any pair of distinct codewords in this code is at least 2. The maximum number of codewords such a code can contain is _________.
asked Nov 14, 2018 in Digital Logic aditi19 1.2k views
0 votes
0 answers
16
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
asked Oct 2, 2018 in Digital Logic Abikkkaaa 639 views
0 votes
1 answer
17
Sixteen-bit messages are transmitted using a Hamming code. How many check bits are needed to ensure that the receiver can detect and correct single-bit errors? Show the bit pattern transmitted for the message 1101001100110101. Assume that even parity is used in the Hamming code. My Solution:- But Correct answer is :- 011110110011001110101 I don't know what i am doing wrong ?
asked Sep 3, 2018 in Computer Networks Na462 2.4k views
0 votes
0 answers
18
Given a binary string , in which direction should we place the parity bits , starting from left to right or right to left? Does both give same result Ex : Data is 1001 1. P1 P2 1 P4 0 0 1 https://www.youtube.com/watch?v=tBacTPPNIrk 2. 1 0 0 P4 1 P2 P1 https://www.youtube.com/watch?v=1A_NcXxdoCc&t=109s Which is correct?
asked Jul 21, 2018 in Digital Logic bhavnakumrawat5 123 views
1 vote
1 answer
19
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
asked Jun 15, 2018 in Computer Networks bts 695 views
1 vote
2 answers
20
0 votes
0 answers
21
Plz someone tell the answer of this question
asked Dec 20, 2017 in Computer Networks nikkey123 85 views
2 votes
1 answer
23
To provide more reliability than the Single Parity Bit technique, a new error-detecting scheme has been proposed. The scheme uses first parity bit for checking all the odd numbered bits and a second parity bit for all the even numbered bits. What is the (minimum) Hamming distance of this code ?
asked Oct 18, 2017 in Computer Networks just_bhavana 1.6k views
0 votes
1 answer
24
Given a binary string , in which direction should we place the parity bits , starting from left to right or right to left? Does both give same result Ex : Data is 1001 1. P1 P2 1 P4 0 0 1 2. 1 0 0 P4 1 P2 P1 Which is correct?
asked Sep 23, 2017 in Computer Networks Parshu gate 1.2k views
3 votes
3 answers
25
asked Aug 15, 2017 in Digital Logic Beyonder 1.5k views
1 vote
1 answer
26
Which of the following are linear block codes?Remember exor of two valid linear block codes is a valid codeword a) CRC b) Hamming code c) Simple parity d)All e)None
asked Aug 15, 2017 in Computer Networks rahul sharma 5 322 views
1 vote
1 answer
27
Following text and screenshot are taken from Forouzan's CN book: "In a linear block code, the exclusive OR (XOR) of any two valid codewords creates another valid codeword." My question is EXoring of which two codewords in Table 10.2 will create first codeword 00000?
asked Jul 31, 2017 in Computer Networks Manu Thakur 1.2k views
0 votes
1 answer
28
For the 7 bit hamming code ,calculate the probability of decoding to a wrong codeword if the code is used for a channel with bit error probability 0.2 ?
asked May 4, 2017 in Computer Networks Kuldeep Pal 156 views
0 votes
1 answer
29
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
asked Oct 29, 2016 in Computer Networks amitlko 180 views
2 votes
1 answer
30
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.
asked Sep 14, 2016 in Computer Networks dd 2.3k views
...