A 15 bit data word along with parity bits received by the receiver is as follows: 101010 111111 011100 110100. Consider the two-dimensional odd parity error detection mechaniem to find out which bit is received in error? if, any. The bits shown in bold with underline are parity bits. Assume sender divides the data in a group of 5 bits each to calculate the parity bits

A 15 bit data word along with parity bits received by the receiver is as follows: 101010 111111 011100 110100. Consider the two-dimensional odd parity error detection mechaniem to find out which bit is received in error? if, any. The bits shown in bold with underline are parity bits. Assume sender divides the data in a group of 5 bits each to calculate the parity 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

If we want to define the Hamming distance for a code, we may use the shortest possible distance between any two encodings (the Hamming distance). Give an example of why it would be preferable not to utilise the maximum or average distance.
IEEE 754-2008 contains a half precision that is only 16 bits wide. Th e left most bit is still the sign bit, the exponent is 5 bits wide and has a bias of 15, and the mantissa is 10 bits long. A hidden 1 is assumed. Write down the bit pattern to represent 1.5625 101 assuming a version of this format, which uses an excess-16 format to store the exponent. Comment on how the range and accuracy of this 16-bit fl oating point format compares to the single precision IEEE 754 standard.
a. Consider the 5-bit generator, G = 10011, and suppose that D has the value 1010101010. What is the value of R? b. In this problem, we explore some of the properties of the CRC. For the generator G (= 1001) given in Section 6.2.3, answer the following questions. a. Why can it detect any single bit error in data D? b. Can the above G detect any odd number of bit errors? Why?
pls send me answer of this question immidiately with explanation and i will give you like sure sir
16- Write the look-up table for 3 bits messages and put the even and odd parity check code. Then find Hamming weight for each code word. Also, find the Minimum Hamming distance.
9
What is the difference between probability of error P(e) and bit error rate BER?
One way of detecting errors is to transmit data as a block of n rows of k bits per row and adding parity bits to each row and each column. The lower-right corner is a parity bit that checks its row and its column, Will this scheme detect all single errors? Double errors? Triple errors?
The erroneous data and control bits were received as 1110101 with a 1 bit error. This format uses D4 D3 D2 C3 D1 C2 C1 where Ds are data bits and Cs are control bits. Find the original error free 4 bit data by VENN diagram. (help: place the bits as shown in the figure. Numbers are bit positions starting from the right). You have to show your solution steps.
Consider a binary code that consists of only four valid code wards as given below: 00000, 01011, 10101, 11110 Let the minimum Hamming distance of the code be p and the maximum number of erroneous bits that can be corrected by the code be q. Then the values of p and q are
Make a bit pattern assuming we're using base 15 numbers instead of base 2 in the fraction. (The symbols 0-9 and A-F are used in Base 16 numbers.) 0-9 and A-E will be used for base 15 numbers.) Assume there are 24 bits and that no normalization is needed. Is this a true representation?
For each of the following binary codes, answer all of the following questions with justification: (a) (b) (c) (d) ● ● Is it linear? What is its block length, message length, and rate? What is its distance? How many errors can it detect, and how many can it correct? (To answer this question you should give the largest number of errors that the code can guarantee to detect or correct. For example a simple parity bit can detect 1 or 3 errors but cannot detect 2 errors so we would say this can detect only a single error. No calculations of probability are required.) The code with seven codewords where seven messages are encoded as follows: 0000000 0010011 0100101 0110110 1001001 101 1010 1101100 The code consisting of thirty-two codewords where each codeword consists of a 5-bit message padded with an additional bit to give ODD parity: that is, each codeword contains an odd number of 1s. For example the word 11111 would be padded with a 0 to give 111110, while 00000 would be padded with a 1…