With 1 parity bit we can detect all 1-bit errors. Show that at least one generalization fails, as follows: (a) Show that if messages m are 8 bits long, then there is no error detection code e = e(m) of size 2 bits that can detect all 2-bit errors. Hint: Consider the set M of all 8-bit messages with a single 1 bit; note that any message from M can be transmuted into any other with a 2-bit error, and show that some pair of messages m₁ and m2 in M must have the same error code e. (b) Find an N (not necessarily minimal) such that no 32-bit error detection code applied to N-bit blocks can detect all errors altering up to 8 bits.

With 1 parity bit we can detect all 1-bit errors. Show that at least one generalization fails, as follows: (a) Show that if messages m are 8 bits long, then there is no error detection code e = e(m) of size 2 bits that can detect all 2-bit errors. Hint: Consider the set M of all 8-bit messages with a single 1 bit; note that any message from M can be transmuted into any other with a 2-bit error, and show that some pair of messages m₁ and m2 in M must have the same error code e. (b) Find an N (not necessarily minimal) such that no 32-bit error detection code applied to N-bit blocks can detect all errors altering up to 8 bits.

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

I need correct figure and answer only upvote Otherwise downvotes
Let A be the set of all strings of 0's and 1's, and let T be the set of all strings of 0's and 1's that consist of consecutive triples of identical bits. Consider the coding and decoding functions E and D defined below : Find E (0110) and D (111111000111). E (0110)=? D (111111000111)=?
Sketch the following signals:(a) y(t) = x(-t-4) given x(t) = 1, -1≤ t ≤ 3(b) y(n) = x(-n) given x(n) = u(n)-u(n-4)
I need the answer as soon as possible please.
2. A binary cyclic code of (15,7) has generator polynomial g(x) = (x*+x+1)(x*+x³+x²+x+1). Give a generator matrix and parity-check matrix for the code. b. Consider the n =7 binary cyclic code generated by g(x) = 1 +x+ x. Find all code words of the code.
Let C be the binary linear code with basis B = (0011001, 1000010, 1111111) with information bits in positions 2, 4, and 6. State the codeword x that encodes the message m = 110: Tip You can solve equations and use row reductions here- but since the basis is smal, it might be easiest just to look at its codewords and use intelligent trial and error. A correct answer is 0111101, which can be typed in as follows: 0111101 Let Cbe the cnde cansis
We have seen that the bit string for the set {I, 3, 5, 7, 9} (with universal set {l, 2, 3, 4,5, 6, 7, 8, 9, 1 OJ) is10 1010 1010.What is the bit string for the complement of this set?
Let n be an even integer where n>0. How many bitstrings have more ones than zeros with a length n? The answer does not have to be in a closed form
Q-2 Suppose that you pick a bit string from the set of all bit strings of length ten. What is the probability that the bit string has more 0s than 1s?
Let U = l, 2, 3, 4, 5, 6, 7, 8, 9, 1 O, and the elements of U are arranged in increasing order; that is, aj = i. What bit strings represent the subsets of all odd integers in U, all even integers in U, and integers not exceeding 5 in U?
Let's say that the components of U are arranged in ascending order, with U = l, 2, 3, 4, 5, 6, 7, 8, 9, and 1 O, which means that aj = i. What bit strings encompass the subsets of all odd numbers in U, all even integers in U, and all integers in U that do not exceed 5?
Q2) Consider a (7,4) code with generator matrix G=[ 1 1 0 1 0 0 0 0 1 1 0 1 0 0 1 1 1 0 0 1 0 1 0 1 0 0 0 1 ] , Encode the messages 1110, 1010, 0001.