Exercise on Hamming Code An 8-bit data word stored in memory is 00111100, while word fetched from the memory is 00101100. 1) How many check bits should be combined in word stored and word fetched? 2) Find check bits in word stored. 3) Find check bits in word fetched. 4) Find which bit position contains error.

Exercise on Hamming Code An 8-bit data word stored in memory is 00111100, while word fetched from the memory is 00101100. 1) How many check bits should be combined in word stored and word fetched? 2) Find check bits in word stored. 3) Find check bits in word fetched. 4) Find which bit position contains error.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter8: Data And Network Communication Technology

Section: Chapter Questions

Problem 31VE

See similar textbooks

Similar questions

Suppose we want an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 12. 1. a) How many parity bits are necessary? 2. b) Assuming we are using the Hamming algorithm presented in this chapter to design our error-correcting code, find the code word to represent the 12-bit information word: 1 0 0 1 0 0 0 1 1 0 1 0.
Suppose we are working with an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 12. a) How long should the check bits and why? b) Code words are created according to the Hamming Algorithm presented in the text. We now receive the following code word: 0 1 1 0 0 1 0 1 0 0 1 1 0 1 0 0 1 Assuming even parity, is this a legal code word? If not, according to our error-correcting code, where is the error? PLEASE SHOW ALL WORKING UNDERSTANDABLE THANK YOU
Suppose we are working with an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 12. a) How long should the check bits and why? b) Code words are created according to the Hamming Algorithm presented in the text. We now receive the following code word: 0 1 1 0 0 1 0 1 0 0 1 1 0 1 0 0 1 Assuming even parity, is this a legal code word? If not, according to our error-correcting code, where is the error?
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. We now receive the following code word: 1 0 1 0 1 0 1 1 1 1 0 Assuming even parity, is this a legal code word? If not, according to our error-correcting code, where is the error?
How many check bits are needed if the Hamming error correction code is used to detect single bit error in a 128 –bit data word?
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. We now receive the following code word: 1 0 1 0 1 0 1 0 1 1 0 Assuming odd parity, is this a legal code word? If not, according to our error-correcting code, where is the error?
A block of bits with n rows and k columns uses horizontal and vertical parity bits for error detection. Suppose that exactly 4 bits are inverted due to transmission errors. Drive a mathematical expression of n and k for the total number of different cases where these 4 error bits will be undetected. Show each important step of your derivation. (Hint: the error bits will be undetected if all the parity bits computed from the block remain unchanged.)
How many check bits are needed if the Hamming error correction code is used to detect single bit errors in a 1200-bit data word?
You are given sixty-four bit integer and a list of bit position p[1] p[2], p[k] for k < 65 generate new sixty-four bit integer that lowest bits are the extracted bits from integer X at input bit positions p. Explain your steps clearly
Take the 127-bit binary BCH code with a 6-bit target distance and the 128-bit binary field extension F 128. How large is the code, and is there a minimum distance you can guarantee?
Take the 127-bit binary BCH code with a 6-bit target distance and the 128-bit binary field extension F 128. How big is the code, and is there a minimum separation you can promise?
given the 16 bit value 1001101011001101 . what operation must be performed in order to see to 1 the last eight bits?