Consider an (8,4) binary linear block code with minimum distance of 4. • How many valid codewords are there? • What is the code rate? • What is the minimum weight of the code? • If the code is used for error detection only, how many errors can it detect? • If the code is used for error correction, how many errors can it correct?

Consider an (8,4) binary linear block code with minimum distance of 4. • How many valid codewords are there? • What is the code rate? • What is the minimum weight of the code? • If the code is used for error detection only, how many errors can it detect? • If the code is used for error correction, how many errors can it correct?

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

Limits of Representation Suppose we use a 16-bit Two's Complement representation for integers. what is the largest positive number that we can represent? show the 16-bit representation of the largest positive integer what is the lowest negative number that we can represent? (be clear: -34 is 'lower' than -33) show the 16-bit representation of the lowest negative number
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?
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 present the 10-bit information word: 1 00 1 1 00 1 1 1 We now receive the following code word: C. 10 10 1 1 0 0 0 0 10 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?)
Using the CRC polynomial x³+x²+1, compute the CRC code word for the information word, 1100011. Check the division performed at the receiver 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 as discussed in this class to design our error-correcting code, find the code word to represent the 10-bit information word: 1001100110. (8 points).
Complete the table by finding each character block with its parity bit with the conditions. Even parity is set to '1.' • Odd parity is set to '0'. Number of Parity Parity Bit Set ASCII Binary with Parity Bit Bits 2 Even 1 10010001 4 Even 1 N 3 4 5 6 7 8 9 Use the string ("Hi, Word!") Letter H [SPC] W O r d ! ASCII Binary Equivalent 1001000 1101001 0101100 0100000 1010111 1101111 1110010 1100100 0100001
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?
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?
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.
Consider a hypothetical 8 bit floating point machine representation with a sign bit, a 3 bit exponent, and a 4 bit mantissa (se1e2e3b1b2b3b4), where the exponent bias is 3 (add 3 to exponent of number to form machine representation). Recall that actual mantissa has 5 bits, since the leading 1 is not stored on the machine. (a) What is the number ?≈2.718 in this 8-bit format? (b) What is the number that (10100111)2 represents in this 8-bit format? (c) What is the upper bound of the relative error when representing a real number in this 8-bit format?
If we use the 128-bit binary field extension F 128 to decode the 127-bit binary BCH code at a distance of 6, we get a total of 127 bits. How big is the code, and is there a guaranteed minimum separation?
Answer the given question with a proper explanation and step-by-step solution. Consider a Hamming (7.4) code in which the parity bits are calculated according to the following equations: r0 = a0 + a1 + a2 r1 = a1 + a2 + a3 r2 = a0 + a1 + a3 The following dataword is to be coded with this scheme: format: a3 a2 a1 a0 0010 What is the parity code for the above dataword? Show it in decimal format for (r2,r1,r0); e.g. if the resulting bits are r2=1, r1=0, r0=0 (100), type the decimal equivalent of 100, which is 4.
- In a codeword, we add two redundant bits to each 8-bit data word. Find the following: Number of valid codewords , Number of invalid codewords. - If we want to be able to detect 2-bit errors, what should be the minimum Hamming distance? - In CRC, if the dataword is 5 bits and the codeword is 8 bits, how many 0s need to be added to the dataword to make the dividend? What is the size of the remainder? What is the size of the divisor?