Assume bit stream of 1110010 as data, polynomial X²+X as divisor. Using the Cyclic Redundancy Check (CRC) algorithm: a. Show in detail the calculations that need to be done by sender to generate sending bit stream. b. Show in detail the calculations that need to be done by receiver to check if the bit stream is received correctly.

Assume bit stream of 1110010 as data, polynomial X²+X as divisor. Using the Cyclic Redundancy Check (CRC) algorithm: a. Show in detail the calculations that need to be done by sender to generate sending bit stream. b. Show in detail the calculations that need to be done by receiver to check if the bit stream is received correctly.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter8: Data And Network Communication Technology

Section: Chapter Questions

Problem 4VE

See similar textbooks

Similar questions

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.
2) Compute data sent for a bit stream of 101011 with CRC using a generator 1010 Randomly assume any bit to have been corrupted, Illustrate how the receiver can detect if the data was corrupted.
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?
q5- How the CRC (Cyclic Redundancy Check) checksum can be applied for detecting data transmission errors? Calculate 3-bit CRC checksum for a message string 11010011101 and show the steps involved. Use 1011 as divisor and show your working.
Suppose the DES Mangler function mapped every 32-bit value to zero, regardless of the value of its input, what function would DES compute? Solve this question by answering the following 3 sub-questions. What is the result of each round? What is the result after the 16 rounds? Remind DES = Initial permutation + 16 rounds + swap halves + final permutation? Assume the original message is a 64-bit message, i.e., 1 2 3 4 … 64. Specify the bit positions by then end of these 4 operation. Must provide detailed explanation of the calculation steps.
Suppose the DES Mangler function mapped every 32-bit value to zero, regardless of the value of its input, what function would DES compute? Solve this question by answering the following 3 sub-questions. What is the result of each round? What is the result after the 16 rounds? Remind DES = Initial permutation + 16 rounds + swap halves + final permutation? Assume the original message is a 64-bit message, i.e., 1 2 3 4 … 64. Specify the bit positions by then end of these 4 operation. Use 8x8 matrix for this. Must provide detailed explanation of the calculation steps.
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
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. Suppose we have to transmit a list of five 4 bit numbers that we need to send to a destination. Show the calculation using checksum method at the sender and receiver side if the set of numbers is ( 3, 7, 9, 11, 13).
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.
The following bit stream : 0111110001010011111111100101111111111110 represents data that needs to be framed by the link layer on the sender’s side. Derive the resultant bit stream by adding necessary flag bits and performing bits stuffing. assume that the link layer uses the flag bits with bit stuffing approach for framing, with the following details: The beginning and end of a data frame are indicated by the special flag bits 01111110 (i.e., 0x7E). To handle accidental occurrence of the flag bits within the data, a 0 bit is stuffed every time 5 consecutive 1s are found in the data. For simplicity, assume that no other header/trailer information is added to the data. I got this answer below but it is wrong. 0111111001111100001010011111011110010111110111111011001111110