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

a. Compute CBC-MAC for a message of 16 bits, “8642” (in Hexa). Assume a block size of 8 bits with an IV=F1 (in hexa). For simplicity, assume the encryption to be a simple XOR of the key with the plaintext. Let the encryption key be B4 (in Hexa). (Hint: Divide the message into blocks of 8 bits each; XOR each block with the previous cipher output; then encrypt this with the key. For the first block, XOR it with IV. Details in pages 325-326 Ch.12 of the textbook) b. Suppose Alice computes the Secret prefix MAC (page 322: secret prefix MAC(x) = h(key || x)) for the message ”AM” (in ASCII) with key “G” (in ASCII) that both Alice and Bob know. The hash function that is used is h(x1x2x3)= g(g(x1 XOR x2) XOR x3 ) where each xi is a character represented as 8 bits, and g(x) is a 8-bit string that is equal to the complement of bits in x. For example, g(10110011) = 01001100. The MAC is 8 bits. (8-bit ASCII representation of the characters is given below.) What is the Secret prefix MAC…
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
4-The following block is sent: 0110111 0101010 1101010 1010101. Using a 2-dimensional parity check, what will be received by the receiver without the block being corrupted in transmission. put a space after each frame (8 bits). your final answer shoule be 5 frames. 5-Given: Original message : 110101010; Generator: 1010 Perform a CRC Calculation: 6-The symbols M and N are transmitted. Show the transmission of this data (at the sender and receiver) using Checksum Method.
Compute CBC-MAC for a message of 16 bits, “ABCD” (in Hexa). Assume a block size of 8 bits with an IV=C9 (in hexa). For simplicity, assume the encryption to be a simple XOR of the key with the plaintext. Let the encryption key be D8 (in Hexa). (Hint: Divide the message into blocks of 8 bits each; XOR each block with the previous cipher output; then encrypt this with the key. For the first block, XOR it with IV.
Computer Science With the CBC/OFB/CFB/CTR mode: (a) if there is a single bit transmission error in block C3 of the ciphertext, which plaintext blocks are affected? CBC and CTR (b) Suppose that there is a bit error in the source version of P1. Through how many ciphertext blocks is this error propagated? What is the effect at the receiver?
Suppose that a binary message – either 0 or 1 – must be transmitted by wire from location Ato location B. However, the data sent over the wire are subject to a channel noise disturbance,so to reduce the possibility of error, the value 2 is sent over the wire when the message is1, and the value −2 is sent when the message is 0. If X, X = {−2,2}, is the value sent atlocation A, the value received at location B, denoted as R, is given byR = X + N ,where N is the channel noise disturbance, which is independent of X. When the message isreceived at location B, the receiver decodes it according to the following rule:if R ≥.5, then conclude that message 1 was sentif R < .5, then conclude that message 0 was sentAssuming that the channel noise, N, is a unit normal random variable and that the message0 or 1 is sent with equal probability, what is the probability that we conclude that the wrongmessage was sent? This is the probability of error for this communication channel
With the use of a Checksum Method, show the transmission of “m” and “n” from the sender to destination side. The following block is sent: 00001111 11110000 11001100 10101010. With the use of a two-dimensional parity check and assuming that no single/multiple-bit or burst error have occurred, what will be received in the receiver side? NOTE: Put a space after each frame.
Suppose Alice and Bob are going to communicate using AES in CBC mode. Unfortunately Alice's message length (in bytes) is not a multiple of 16. Suppose the last block of her message is just a single zero byte. How can she pad out the last block so that she can use CBC mode? Since this needs to be a reversible operation, how does Bob recognize the padding and remove it?
In this problem, we will get practice with computing the one’s complement of the one’s complement sum over a sequence of data values. We will use the exact same algorithm used to compute TCP/UDP checksum, but over a sequence of 4-bit chunks rather than 16-bit chunks. (a) Consider the following data bits. What is the (4-bit) checksum of this (8-bit) data? 0101 1100 (b) Consider the following data bits. What is the 4-bit checksum of this (12-bit) data? (Note: you may be able to reuse calculations from part (a).) 0101 1100 1001
If an error happened in the following scenario, please mention whether it occurred. The sender sends the number “001011010” to the recipient. The devices make use of odd parity, 8-bit data, and a 1-bit (LSB) parity for each bit of information. What happens if the devices are utilizing even parity instead than odd? What are the communication protocols that are utilized in TESLA automobiles? Insert the schematic of the one(s) that you have discovered.
We consider a noisy communication link in which the message is encoded into binary digits (0,1) (bits)before being transmitted. We will denote the length of the encoded message by n. Since the channel isnoisy, the bits can get flipped; a 0 to 1 or a 1 to 0. We will assume that each bit is flipped independently withprobability p. In order to be able to detect that the received message is in error, a simple method is to add aparity bit at the transmitter. There can two types of parity - even parity and odd parity. If even (odd) parityis used , the parity bit is set such that total number of 1s in the encoded message is even (odd). For the sakeof this problem, we will only consider even parity. Here are a few examples1) message: 0001 + parity bit: 1 --> encoded message: 000112) message: 0101 + parity bit: 0 --> encoded message: 010103) message: 0111 + parity bit: 1 --> encoded message: 01111At the receiver, the parity bit is computed from the message bits. If the received parity…
1. If they each want to send the following bit show the total signal sent Reciever Code R1 1 R2 1 R3 0 R4 1 2. How would R1 recover its signal?. 3. Consider a case with the same codes but only R1 wants to send. Reciever Code R1 1 R2 - R3 - R4 - What signal would be sent, and how would R1 recover its signal now? 4. If an error occurs in question 12, and some bits are flipped in the signal sent from positive to negative or the other way around, how many bits minimum would need to be flipped for R1 to recover the wrong signal? 5. CDMA has another important real-world use in addition to multiple access. Given the answer to the previous question, what do you think that purpose is? How does it accomplish this? Note: this is one big question where each part couldn't be seperately asked. The picture below is the 4 recievers from the start of the question.