Let's let Ig(x) mean the log base 2 of x. We said that the number of checkbits c for d data bits is approximately Ig(d). For the first few values of c, figure out how many data bits there could be and what the total number of bits b = d+ c is. Look for patterns involving powers of 2 or Ig(x). Based on this, what can you conclude?

Let's let Ig(x) mean the log base 2 of x. We said that the number of checkbits c for d data bits is approximately Ig(d). For the first few values of c, figure out how many data bits there could be and what the total number of bits b = d+ c is. Look for patterns involving powers of 2 or Ig(x). Based on this, what can you conclude?

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

can you expplain further how to get to that solution? my understanding is if we have 2^24, the row decoder will be 2^12 and column decoder will be 2^12. what happens if the N number is odd? My understanding is that we divide the N bits by 2 but what happens if it's odd
how many 11 - strings (that is, bit strings of length 11) are there which: a. start with sub - string 011 b. have weight 8 (i.e contain exactly 8 1's ) and start with the sub - string 011 c. either start with 011 or end with 01 (or both) d. have weight 8 and either start with 011 or end with 01 (or both)
In the notes on amortized analysis, we gave a “toy example” of a binary counter with the operationscreate and increment. We showed that the amortized times for the create and incement operationswere O(n) and O(1), respectively. To do this, we defined the potential function of the counter to bethe number of 1-bits, counting all bits and not just the rightmost bits.Suppose that instead we were to choose the potential function to be the number of rightmost 1-bits(i.e., the number of 1-bits before the first 0-bit). Show that with this definition of the potentialfunction, the amortized time of the increment operation is not O(1).
So i have to find the minimum hamming distance of a binary code c={1001, 0111, 1110, 1100, 0000, 1010, 1111, 1100}, now in one part of my lecture i think my prof said the min d equals the smallest weight of the nonzero character and that would be 2 but at the same time the min between 0111 and 1111 is 1 so which one is hammings min distance?
Consider the picture Consider the picture Determine the values of Tk(k=1,…,9) knowing that Tk is obtained by the arithmetic mean of its four neighbors. So for example,
5) In section 11.3(ebook), the two complements operation is defined. To find the twos complement of X, take the Boolean complement of each bit of X, and then add 1. (a)Show that the following is an equivalent definition. For an n-bit integer X, the twos complement of X is formed by treating X as an unsigned integer and calculating (2n-X). (b)Demonstrate that Figure 11.5 can be used to support graphically the claim in part (a), by showing a clockwise movement is used to achieve subtraction.
Given are the following codewords for an error control coding scheme data 000 011 100 codeword 00011000 00000111 10101000 . a.What is the minimum Hamming distance? b. What is the coding rate for this scheme? c. what raw data rate would be required if we need a throughput of 6 Mpbs? d. in a different situation, the number of data bits to transfer is 5, and the minimum hamming distance is dmin=5. find the maximum coding rate for this situation
Given b, set the low-order b bits of x to 1; the others to 0. For example, if b is 3, x should be 7. Pay special attention to the edge cases: if b is 32 x should be −1; if b is 0 x should be 0.
Consider all bit (binary digit) strings of length 12. How many begin with 110? How many begin with 11 and end with 10? How many begin with 11 or end with 10? How many have exactly four 1s?
Need typed solution How many 10 bit strings have an equal number of 0's and 1's? How many have 8(only 8) consecutive 1's?
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 large is the code, and is there a minimum distance you can guarantee?
Consider the Cyclic Redundancy Check (CRC) algorithm discussed in Section 6.2.3 of the textbook. Suppose that the 4-bit generator (G) is 1011, that the data payload (D) is 10011101 and that r = 3. What are the CRC bits (R) associated with the data payload D, given that r = 3?