**Error-Correcting Code for Memory Words of Length 10**Suppose we want an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 10.**a. How many parity bits are necessary?**---**b.** Assuming we are using the Hamming algorithm presented in this chapter to design our error-correcting code and an **odd parity**, find the code word to represent the 10-bit information word:\[ 1 \ 0 \ 0 \ 1 \ 1 \ 0 \ 0 \ 1 \ 1 \ 1 \]---**c.** We now receive the following code word:\[ 1 \ 0 \ 1 \ 0 \ 1 \ 1 \ 0 \ 0 \ 0 \ 0 \ 1 \ 0 \ 1 \ 1 \]Is this a legal code word, assuming an odd parity? If not, what is the corrected code word? (Which bit is the error bit?)

Answered: Image /qna-images/answer/95107b7a-4499-4571-b3fd-2ad08b0df392.jpg

Answered: Suppose we want an error-correcting…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

No hand written and fast answer with explanation
Show how the decimal floating point number -76.31e is stored in the computer's storage using IEEE754 32-bit single precision format. Assume "0" represents positive sign and "I" represents negative sign. Show your conversion steps clearly.
Calculate the parity of a byte with the value 31 and show the pattern stored to memory. Assume the parity bit is on the right. Suppose the most significant bit was inverted in memory, and then you read it back. Did you detect the error? What happens if the two most significant bits are inverted?
[4.1] Consider the number -1.36875 x 10¹ as the dividend and 5.625 x 10¹ as the divisor. a. Find their binary representation. b. Normalize the results that you got it in (A) and put them in the 8-bit quarter- precision format (1 for sign bit, 2 for exponent, and 5 for fraction). c. Implement the division and show all the steps of the division to results that you got it in (B). Show if there is an overflow or underflow by assuming that there is a guard bit, a round bit, and a sticky bit.
The following is a string ASCII characters whose bit patterns have been converted into hexadecimal for compactness: CD 69 E4 54 E5 72 6D Of the eight bits in each pair of digits, the left most is a parity bit and the remaining bits are the ASCII code. Convert the string to bit form and decode the word in ASCII. What is the parity for each letter of the word?
Assume we have a 2's complement system with an 8-bit whole number part and a 2-bit fractional part. Find a decimal representation of 2's complements binary number 1110 0010.01 it expects a numeric entry. It will automatically suppress leading and trailing zeros. It will display your answer with commas every third digit.
q/Develop the 1- Shannon(binary and ternary) code. 2- Shannon-Fano(binary and ternary) code. 3- Huffman(binary and ternary) code. For the following set of symbols (0.2 , 0.25 , 0.25 , 0.15 , 0.15)
What decimal value does the 8-bit binary number 10010010 have if: a) it is on a computer using signed-magnitude representation? b) it is on a computer using two's complement representation? c) it is on a computer using excess-M representation?
5. Hamming Codes a) Suppose we want an error correcting code that will allow all single-bit errors to be corrected for memory words of length 15. How many check bits are necessary? b) Suppose we are now working with memory words of length 8. We have already calculated that we need 4 check bits, and the length of all codewords will be 12. We now receive the following code word: 010011011111 Is this a legal codeword, assuming even parity? If not, where is the error?
The table below represents a line in the code for Hamming's code where d = 12 and m = 5. Compute the syndrome and determine if there is an error and which bit, 1-17, is wrong. Recall that if there is no error then position 0 is given as the "error position." 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 D po P1 d11 P2 d10 d9 dɛ p3 d7 do ds dą dz d2 d1 P4 do ? 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 So = [ Select ] S1 = [ Select ] S2 = [ Select ] S3 = [ Select ] S4 = [ Select ] Error Position = [ Select ]
Show the binary sequence of the number (1111001.01)binary in IEEE 754 64bit floating point format.- What is the exponential part in decimal and binary?- What happens to the number part binary? (Although you don't show the rightmost zeros)- How does the whole number appear in binary? (Although you don't show the rightmost zeros)
Consider a code with only four valid codewords: 0000000000,0000011111,11111100000,11111111111. a)what is the hamming distance in this given code? b)prove your answer (a)? c)what is the lower limit on the check bits for this code to correct single errors?

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS

Suppose we want an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 10. a. How many parity bits are necessary?