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

Consider an IEEE-like format ( one sign bit, 4 exp bits and 4 frac bits. ) with four frac bits and four exp bits. (i) What is the smallest integer m not exactly representable? Compute its decimal value. (ii) Is m+1 representable? Show the bit pattern for m+1 in this representation. (iii) What is the machine epsilon of this representation?
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).
Solve the below program in C language. Write a C program to access two dimensional array using pointers.
Question 11 Computer Science Given a binary string of X=10011111, compute its binary arithmetic coding tag T(X), and what will be the coding length?
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
2. Japanese train signals are more complex than ours, but it is needed because Japan has some of the world's fastest train. The signals allow speed in six steps from stand still up to full speed. Design a signal decoder, a combinatorial logie network, which uses a three-bit mode signal M (m2 m1 m0) to generate output signals controlling four colored lights (yl r yo g). Stop (R) Restricted Clear (G) Caution (Y) Reduced Speed (Y over G) Less reduced Speed (Y over Y) Speed (Y over G flashing)
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?
1. Suppose (27.625 base 10) is represented using a 16-bit Floating Point Format where 1 bit is for the sign bit, 5 bits is for exponent and 10 bits is for mantissa. What is the exponent? Do not involve a space character when you type your answer. 2. Suppose (-27.625 base 10) is represented using a 16-bit Floating Point Format where 1 bit is for the sign bit, 5 bits is for exponent and 10 bits is for mantissa. What is the the result? Do not involve a space character when you type your answer.