Using the Hamming code algorithm, what should the receiver do if it receives each of these codes?...
Using the Hamming code algorithm, what should the
receiver do if it receives each of these codes?
Received code:
1 1 1 0 0 0 0 1
Answer: ______________________
Received code:
0 1 0 1 1 1 0 1
Answer: ______________________
Received code:
0 1 1 1 0 1 1 0
Answer: ______________________
Received code:
0 1 1 1 1 1 0 1
Answer: ______________________
5. Below is a set of three 11 bit codes,
labeled (a), (b), (c)
(a) 0 0 0 0 1 1 1 1 0 0 0
(b) 0 0 1 1 0 0 1 1 0 0 1
(c) 0 1 0 1 0 1 0 1 0 1 0
What is the Hamming distance for this set?
d(a,b) = ?
d(b,c) = ?
d(a,c) = ?
Homework Answers
Request Answer!
We need at least 10 more requests to produce the answer.
0 / 10 have requested this problem solution
The more requests, the faster the answer.
Add Answer to:
Using the Hamming code algorithm, what should the
receiver do if it receives each of these codes?...
Question 2. Using the Hamming code algorithm (7,4), convert a data message (0111) using 7bit. a)...
Question 2. Using the Hamming code algorithm (7,4), convert a data message (0111) using 7bit. a) b) c) d) e) Find number of parity bits needed Evaluate values of parity bits using Exclusive-OR. Show final message bits with parity bits. How do you identify that the received message has error? Inject an error (o or 1) at position 3 and identify the error position.
[Hamming algorithm] having problems understanding the step highlighted in bold. explain the part going over checking...
[Hamming algorithm] having problems understanding the step highlighted in bold. explain the part going over checking the parity bits (the problem question is listed below) 12+1+r<=2^r-->r=5 5+12=17 for bit length--> -->parity bits check positions are 1,2,4,8,16-->fill in the using BIN skipping over the 1,2,4,8,16 positions--> --> 1=1 2=2 3=1+2 4=4 5=1+4 6=2+4 7=1+2+4 8=8 9=1+8 10=2+8 11=1+2+8 12=4+8 13=1+4+8 14=2+4+8 15=1+2+4+8 16=4+4+8 from my understanding, you check over the parity bits 1,2,4,8,16. using above as a reference. for bit 1...
Please show how this answer was obtained. Problem #6 (15 points) A 12-bit hamming code was generated from an 8-bit code using the format as follows Original 8-bit value Modified 8-bit value (12-bt ham...
Please show how this answer
was obtained.
Problem #6 (15 points) A 12-bit hamming code was generated from an 8-bit code using the format as follows Original 8-bit value Modified 8-bit value (12-bt hamming code format) 10 9 C3 co The 12-bit hamming code was transmitted over a communication channel. An error may or may not have occurred during the transmission. The received 12-bit values were shown as follows: Received 12-bit value 10 Determine whether an eror had been occurred,...
Q3. In a (7,4) Hamming Code, three parity bits p1, p2, p3 are added to four...
Q3. In a (7,4) Hamming Code, three parity bits p1, p2, p3 are added to four data bits dl, d2, d3, and d4, and the coverage of each parity bit is as shown in the table below: Bit position 2 3 4 5 6 7 Encoded data bits p1 p2 di p3 d2 d3 d4 da X p1 X X X x Parity bit coverage p2 х X X p3 X X X х 1) (3 pts) Assume even parity...
Problem I (Hamming Distance) a) Compute the Minimum Hamming Distance (MHD) for the coding (1101011, 1010110,...
Problem I (Hamming Distance) a) Compute the Minimum Hamming Distance (MHD) for the coding (1101011, 1010110, 0000011, 0001100) b) Modify the code by changing a single bit to increment the previous MHD by 1. Problem Il (ASCII Codes) Use the ASCII translation table to convert the following binary representation to alphanumeric. #1 01000111 01101111 01101100 01100100 01100101 01101110 00100000 01000001 01110010 01100011 01101000 01100101 01110011 00100000 01000110 01101111 01101111 01100100 #2 01000011 01101000 01101001 0110110o 01100100 01110010 01100101 01101110 00100111...
7. Show parity using odd I's with double parity, for following data 11001101110. (10 pt.) UG 8. Show the hamming code for any 6-bit data. (10pt.) 9. What are the polynomial equivalence of fol...
7. Show parity using odd I's with double parity, for following data 11001101110. (10 pt.) UG 8. Show the hamming code for any 6-bit data. (10pt.) 9. What are the polynomial equivalence of following bits. (10 pt.) 1100101 0011101 1110001 010100 Assume a sender has the following data frames. Suppose the sender using burst error detection/correction. Show the actual row and column that is send and received. (10pt.) 1- 0110 2- 1101 3- 0011 4- 0101 11. In terms of...
Given the Hamming code diagram, which of the following statement is true? Question 2 options: A...
Given the Hamming code diagram, which of the following statement
is true?
Question 2 options:
A
M=1, N=1 and K= 1 shows a status of no bit
error
B
M=0, N=0 and K= 0 shows a status of no bit
error
C
M=0, N=1 and K= 0 shows a status of no bit
error
D
M=0, N=1 and K= 1 shows a status of no bit
error
B M 1 1 N 1 1 K 1 с
5-Given that the ASCII code for A is 1000001, what is the ASCII code for J?...
5-Given that the ASCII code for A is 1000001, what is the ASCII code for J? Express the answer as 7 binary digits. 6- Suppose we are working with an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 7. We have already calculated that we need 4 check bits, and the length of all code words will be 11. Code words are created according to the Hamming algorithm presented in the text....
1. (1 pt) Under what conditions would an open-loop protocol such as an error-correcting Hamming code...
1. (1 pt) Under what conditions would an open-loop protocol such as an error-correcting Hamming code be preferable to the feedback type protocols discussed in Chapter 3? 2. (1 pt) Suppose that a stop-and-wait protocol was used on a channel has a 300 millisecond propagation delay and sender frames sizes of 100 milliseconds. The receiver must fully receive the frame before sending an acknowledgment. The size of the acknowledgment can be ignored. What is the channel utilization? 3. (1 pt)...
Ovestinn 5 Comsider de 52) hckk codine scheme e in te e el s Mark Dtawod...
Ovestinn 5 Comsider de 52) hckk codine scheme e in te e el s Mark Dtawod Codewond 0000 01010 10 10100 11 11111 a) What is the number of mdundene bits added to cach datawond b) Find the minimum Hamming distance d of the coding scheme Determine the number of errors that can be detected by this code. c) Determine the number of errors that can be corrected by this code. d) e) Assume that the received codeword is (10101)...
Question 2. Using the Hamming code algorithm (7,4), convert a data message (0111) using 7bit. a) b) c) d) e) Find number of parity bits needed Evaluate values of parity bits using Exclusive-OR. Show final message bits with parity bits. How do you identify that the received message has error? Inject an error (o or 1) at position 3 and identify the error position.
Please show how this answer
was obtained.
Problem #6 (15 points) A 12-bit hamming code was generated from an 8-bit code using the format as follows Original 8-bit value Modified 8-bit value (12-bt hamming code format) 10 9 C3 co The 12-bit hamming code was transmitted over a communication channel. An error may or may not have occurred during the transmission. The received 12-bit values were shown as follows: Received 12-bit value 10 Determine whether an eror had been occurred,...
Q3. In a (7,4) Hamming Code, three parity bits p1, p2, p3 are added to four data bits dl, d2, d3, and d4, and the coverage of each parity bit is as shown in the table below: Bit position 2 3 4 5 6 7 Encoded data bits p1 p2 di p3 d2 d3 d4 da X p1 X X X x Parity bit coverage p2 х X X p3 X X X х 1) (3 pts) Assume even parity...
Problem I (Hamming Distance) a) Compute the Minimum Hamming Distance (MHD) for the coding (1101011, 1010110, 0000011, 0001100) b) Modify the code by changing a single bit to increment the previous MHD by 1. Problem Il (ASCII Codes) Use the ASCII translation table to convert the following binary representation to alphanumeric. #1 01000111 01101111 01101100 01100100 01100101 01101110 00100000 01000001 01110010 01100011 01101000 01100101 01110011 00100000 01000110 01101111 01101111 01100100 #2 01000011 01101000 01101001 0110110o 01100100 01110010 01100101 01101110 00100111...
7. Show parity using odd I's with double parity, for following data 11001101110. (10 pt.) UG 8. Show the hamming code for any 6-bit data. (10pt.) 9. What are the polynomial equivalence of following bits. (10 pt.) 1100101 0011101 1110001 010100 Assume a sender has the following data frames. Suppose the sender using burst error detection/correction. Show the actual row and column that is send and received. (10pt.) 1- 0110 2- 1101 3- 0011 4- 0101 11. In terms of...
Given the Hamming code diagram, which of the following statement
is true?
Question 2 options:
A
M=1, N=1 and K= 1 shows a status of no bit
error
B
M=0, N=0 and K= 0 shows a status of no bit
error
C
M=0, N=1 and K= 0 shows a status of no bit
error
D
M=0, N=1 and K= 1 shows a status of no bit
error
B M 1 1 N 1 1 K 1 с
1. (1 pt) Under what conditions would an open-loop protocol such as an error-correcting Hamming code be preferable to the feedback type protocols discussed in Chapter 3? 2. (1 pt) Suppose that a stop-and-wait protocol was used on a channel has a 300 millisecond propagation delay and sender frames sizes of 100 milliseconds. The receiver must fully receive the frame before sending an acknowledgment. The size of the acknowledgment can be ignored. What is the channel utilization? 3. (1 pt)...
Ovestinn 5 Comsider de 52) hckk codine scheme e in te e el s Mark Dtawod Codewond 0000 01010 10 10100 11 11111 a) What is the number of mdundene bits added to cach datawond b) Find the minimum Hamming distance d of the coding scheme Determine the number of errors that can be detected by this code. c) Determine the number of errors that can be corrected by this code. d) e) Assume that the received codeword is (10101)...
Most questions answered within 3 hours.
-
Assume you are the holder of a call option on €10,000. The
option premium is $0.25...
asked 16 minutes ago -
Purchases divided by accounts payable provides information
about: capital structure management of working capital gross profit...
asked 5 minutes ago -
Java
Activity 1.
Suppose we want to have an object-oriented design for an
invoicing system, that...
asked 13 minutes ago -
How
do infected individuals “fight” the Trypanosoma parasite?
asked 15 minutes ago -
Name a common privileged structure and a common pharmacophore.
Thank you!
asked 12 minutes ago -
A hockey puck of mass 1 kg is traveling at 2 m/s in a direction
40º...
asked 14 minutes ago -
in python how to I get python to display 1 of 3 message every 45
seconds...
asked 16 minutes ago -
1. Which of the following is an advantage of a sole
proprietorship over other business forms?...
asked 27 minutes ago -
Create a new database and execute the code below in SQL Server’s
query window to create...
asked 31 minutes ago -
An appliance manufacturer offers extended warranties on its
washers and dryers. Based on past sales, the...
asked 33 minutes ago -
You have a lens whose focal length is 12.7 cm. You place an
object on the...
asked 38 minutes ago -
An agent for a residential real estate company in a large city
has the business objective...
asked 39 minutes ago