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

Can you do number 2 for me please
Write a general code for a polar RZ line coding scheme. assigned decimal number = 248 This number is to be converted to line code. And, bit duration = 9 µs Specifications: 1. Line Coding Scheme: Polar return to zero 2. Binary Code to be Generated: Assigned decimal number 248 3. Duration of Each Bit: 9 µs
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?
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
When calculating error detection code FCS, you may use a technique called cyclic redundancy checking (CRC). What is the preset divisor P's length in bits for a 16-bit bit block with a total of 20 bits (total length of bit block and FCS combined)?
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?
1- Given RO, R1, R2, and R3 followed by the indicated base; i- Convert each value into its corresponding 9 bit binary value, the most significant bit is used as the sign bit, separate the sign bit with a comma, for example; 0,10100000 (RO)8 = 165 (RO)2= Use the 9 least significant bits, discard the extra bits. (RI)16 - FSF (RI)2= (R2)16 = F81 (R2)2= (R3)7 152 (R3)2- %3D (Separte the sign from the other bits with a comma, for example; 110011000 is written as; 1,10011000) ii- Evaluate; R4 - RO + RI. (consider negative numbers to be already given in 2's complement) bit8 bit 7bitóbitit4bit3bit2bitl bito RO RI R4
ki :Given the following stream of bits (01111000), encode these bits of the stream using NRZ-L, NRZ-I, RZ, Manchester and differential Manchester encoding methods
6. The sender sends the following message 00111001011 to the receiver. Using the vertical redundancy check, add the parity bit that will show the string has an error using an even number of ones. Answer: