menu
search
Log In
Quick search syntax
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

Subjects

Recent questions tagged hamming-code

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Recent questions tagged hamming-code

1 vote
1 answer
1
UGCNET-Oct2020-II: 31
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$
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
Morris Mano Edition 3 Exercise 7 Question 42 (Page No. 306)
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$. evaluate the 7-bit composite code word for the data word 0010. Evaluate ... error detection in the code. Assume that error occurs in the bit $D _5 and P _2$. Show how the error is detected.
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
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 32 bits 48 bits
asked Apr 6, 2019 in Digital Logic ajaysoni1924 992 views
1 vote
0 answers
4
Morris Mano Edition 3 Exercise 7 Question 40 (Page No. 306)
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
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
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.
asked Apr 6, 2019 in Digital Logic ajaysoni1924 118 views
0 votes
0 answers
6
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.
asked Apr 6, 2019 in Digital Logic ajaysoni1924 321 views
0 votes
1 answer
7
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 12 (Page No. 252)
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.
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
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 10 (Page No. 252)
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.
asked Mar 16, 2019 in Computer Networks ajaysoni1924 148 views
0 votes
1 answer
9
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 9 (Page No. 252)
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.
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
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 8 (Page No. 252)
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?
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
hamming code
what is approach to solve this type of question?
what is approach to solve this type of question?
asked Jan 19, 2019 in Computer Networks Rahul_Rathod_ 233 views
0 votes
1 answer
13
Hamming Error Correction- Madeeasy 2019
someone please post detailed solution pic for this procedure- I am getting bits 1 and 2 as errorneous.
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
#CN Forouzan Error Correction Hamming Code
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
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
GATE-ECE-2018
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 _________.
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
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
asked Oct 2, 2018 in Digital Logic Abikkkaaa 639 views
0 votes
1 answer
17
Hamming Code
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 ?
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
Doubt
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?
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
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. 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
Hamming Distance Question
asked Dec 31, 2017 in Computer Networks hem chandra joshi 1.9k views
0 votes
0 answers
21
Doubts
Plz someone tell the answer of this question
Plz someone tell the answer of this question
asked Dec 20, 2017 in Computer Networks nikkey123 85 views
2 votes
1 answer
23
hamming distance
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 ?
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
hamming code direction of parity bits From left or right?
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?
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
Hamming Code
asked Aug 15, 2017 in Digital Logic Beyonder 1.5k views
1 vote
1 answer
26
Cn Linear block code
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
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
Hamming Distance, Linear Block Codes
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?
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
coahing
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 ?
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
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)<=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
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.
asked Sep 14, 2016 in Computer Networks dd 2.3k views
Page:
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...