The role of error detection mechanism is to detect errors that occur between the transmission and reception of data stream, especially when one or more bitsare altered. Suppose that a system intends to send a data stream of D= 10111010100010. (a) (b) If an Odd Parity Check scheme is used and the received codeword is 1010101010100100, then determine the error. If Cyclic Redundancy Check (CRC) scheme is used with polynomial generator x³ + x² + 1. Compute the CRC code and the transmitted data frame.

The role of error detection mechanism is to detect errors that occur between the transmission and reception of data stream, especially when one or more bitsare altered. Suppose that a system intends to send a data stream of D= 10111010100010. (a) (b) If an Odd Parity Check scheme is used and the received codeword is 1010101010100100, then determine the error. If Cyclic Redundancy Check (CRC) scheme is used with polynomial generator x³ + x² + 1. Compute the CRC code and the transmitted data frame.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter9: Computer Networks

Section: Chapter Questions

Problem 15VE

See similar textbooks

Similar questions

4. Consider the cyclic redundancy check for computing error detection code FCS. For a bit block of 16 bits with a total length of 20 bits (total length of the bit block and FCS combined), what is the length (in bits) of the predetermined divisor P?
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.
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?
A bit sequence is transmitted using Hamming code. What is the sequence of data bits transmitted for each of the following received streams: 1010 1100 1110, and 0101 0101 0101 0111 1111?
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
A cyclic redundancy check (CRC) error detection scheme is constructed to generate a 4-bit frame check sequence (FCs) for an 11-bit message. The generator polynomial, P(x) = x* + x +1 (i.e., P = поо). 1) Encode the data bit sequence M(x) = x° + +1 (i.e., M= 000011001) using the generator polynomial and state the codeword. 2) Show that the error detection scheme at the receiver can detect the received codeword and contain no error.
Computer Network : Suppose 3 blocks of 16 bits need to be sent, using Checksum method proves the following cases: When there is no error When there is a burst error and detected. When there is a burst error and remains undetected Block 1: 1011101110101011 Block 2: 0101000011111010 Block 3: 0111010110101010
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.
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?
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.
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 bit-stuffing based framing protocol uses a 8-bit delimiter pattern of 00111100. If the output bit-string after stuffing is 001110001101110011, number of bit stuffed is