Using the CRC polynomial 10101 (= x² + x³ + 1), a. How many bits a sender append to this information before computing CRC code word? b. compute the CRC code word for the information word 101101001 c. Check the division performed at the receiver with the cord word of the result of b. If a receiver received a code word, 1011011001010112, does an error in the transmission of information? (Show your work.) d.

Using the CRC polynomial 10101 (= x² + x³ + 1), a. How many bits a sender append to this information before computing CRC code word? b. compute the CRC code word for the information word 101101001 c. Check the division performed at the receiver with the cord word of the result of b. If a receiver received a code word, 1011011001010112, does an error in the transmission of information? (Show your work.) d.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter8: Data And Network Communication Technology

Section: Chapter Questions

Problem 38VE

See similar textbooks

Similar questions

In a two-dimensional decimal parity-check which uses check digits, if we receive the following transmission: 257103550 Assuming there is at most 1 error, which of the following is the correct original underlying message: a) 257303550 b) 217503550 c) 2150 d) 7355 e) 2530
Given that K=3 and the transmitted message is repeated 7 times, what is the value of R?
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).
Q) Consider the use of hamming codes to send 11-bit messages. Specifically, consider 10011011011. First, calculate the hamming code-word for this message. Second, invert one message bit in that Hamming code-word (to represent a 1-bit error) and show how the recipient can use the check bits to correct the inverted bit (that is, perform the error correction)
How many bit strings of length 10 a) begin with 101? b) have weight 3 and begin with 101? c) have weight 5 and begin with 101?
a) Compute the CRC for the following message M = 1110 1010 1110 0100 0101 using the generator x4+x2+x+1. Show your detailed work. Let us call M’ the message M after appending the CRC to it. b) Suppose the following error message E = 1111 0000 1110 0000 1010 0000 is XORed to M’ obtained in part a. Is the error detected at the receiver? Show your detailed work.
90. In CRC checksum method, assume that given frame for transmission is 1101011011 and the generator polynomial is G(x) = x^4 + x + 1.After implementing CRC encoder, the encoded word sent from sender side is ............. a. 11010110111110 b. 11101101011011 c. 110101111100111 d. 110101111001111
How many bit strings of length 10 contain a) exactly four 1s? b) at most four 1s? c) at least four 1s?
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?
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
We indicated that the goal of any communications is that the received information should “equal” the transmitted information. Give an example application where:The received information needs to be “exactly equal” to that transmitted. Discuss why that is?
How many bit strings contain exactly five 0’s and ten 1’s if every 0 must be immediately followed by a 1?