(i) Apply the cyclic redundancy check (CRC) based error detecting scheme for the message 11001001 is to be transmitted using the CRC generator polynomial x³+1 to protect it from errors. Then what should be transmitted bits and also verify at receiver end the code word is re-form the original data or not. (ii) List out the available error detection methods in DLL.

(i) Apply the cyclic redundancy check (CRC) based error detecting scheme for the message 11001001 is to be transmitted using the CRC generator polynomial x³+1 to protect it from errors. Then what should be transmitted bits and also verify at receiver end the code word is re-form the original data or not. (ii) List out the available error detection methods in DLL.

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

Let M be the plaintext message M = MALAYSIA and the private key, K = ISSOGOOD. Using the appropriate steps of DES operation, get the final output of the key for round 1 with the permutation compression (PC) table provided below, In round 1, get the output for the XOR operation of plaintext and the key, according to the DES operation. a) Based on the output above, explain the next process using the S-box table below, and show the output from this operation. DO NOT COPY and PASTE!
Let M be the plaintext message M = MALAYSIA and the private key, K = ISSOGOOD. Using the appropriate steps of DES operation, get the final output of the key for round 1 with the permutation compression (PC) table provided below, In round 1, get the output for the XOR operation of plaintext and the key, according to the DES operation. a) Based on the output above, explain the next process using the S-box table, and show the output from this operation.
Use 5-Bit RC4 to decrypt the message XNV@H-Translate between characters and numbers using ASCII minus 64 (so @=0, A=1,... _=31).-The key is DISCRETE.
In the steps of “Append the padding bits” in SHA-512 system (shown in Figure 1), the message is padded so that its length is congruent to 896 mod 1024 or (length ≅ 896 mod 1024). State the value of the following padding field is the message length is: a) 1919 b) 1920 c) 2942
Use Huffman code to demonstrate that a variable length encoding scheme can be used to compress the following message: rammer_jammer_yellow_hammer_give_them_h_alabama How many bits were saved over a MINIMAL FIXED LENGTH encoding scheme?
Assume that the following block of 16 bits is to be sent using a checksum of 8 bits. What is the pattern (codeword) sent? The block 0f 16 bits is 10101001 00111001.
Let M be the plaintext message M = MALAYSIA and the private key, K = ISSOGOOD Using the appropriate steps of DES operation, get the final output of the key for round 1 with the permutation compression (PC) table provided below, For round 1, get the output for the XOR operation of plaintext and the key, according to the DES operation. Based on the output above, explain the next process using the S-box table, and show the output from this operation. Based on the output of of 4(a), explain the next process using a straight permutation table, and show the output from this operation.
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).
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.
1. Let M be the plaintext message M = MALAYSIA and the private key, K = ISSOGOOD a) Using the appropriate steps of DES operation, what is the final output of the key for round 1 (hint: you have to use the circular left shift and permutation compression (PC) table provided below). b) For round 1, please provide your output for the XOR operation of plaintext and the key, according to the DES operation. c) Based on the output of 4(b), explain the next process using the S-box table, and show the output from this operation. d) Based on the output of 4(c), explain the next process using a straight permutation table, and show the output from this operation.
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?
To what extent may a message's parity bits be used to detect errors?