ZuoTi.Pro
Question

Suppose we want to transmit the message 10011010 and protect it from errors using the CRC...

Suppose we want to transmit the message 10011010 and protect it from errors using the CRC polynomial x^2+1.

  1. Encode the data bit sequence using the generator polynomial and give the code word.

  2. Using this polynomial, can all single-bit errors be detected? If not, give an example scenario of errors that goes undetected.

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

0 0
Add a comment
Know the answer?
Add Answer to:
Suppose we want to transmit the message 10011010 and protect it from errors using the CRC...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • assume we want to transmit the message 10001111 and protect it from errors using the CRC...

    assume we want to transmit the message 10001111 and protect it from errors using the CRC polynomial x3 + 1 Use polynomial long division to determine the message that should be transmitted. Suppose the leftmost bit of the message is inverted due to noise on the transmission link. What is the result of the receiver’s CRC calculation? How does the receiver know that an error has occurred?

  • 4) (2 pts) Chapter 2 Text Book Problem 8 Suppose you want to send some data...

    4) (2 pts) Chapter 2 Text Book Problem 8 Suppose you want to send some data using the BISYNC framing protocol and the last 2 bytes of your data are DLE and ETX, What sequence of bytes would be transmitted immediately prior to the CRC? 5) (2 pts) Chapter 2 Text Book Problem 18 Suppose we want to transmit the message 11100011 and protect it from errors using the CRC polynomial x +1. (a) Use polynomial long division to determine...

  • 1) (6 pts) A message M = 11101 is to be transmitted from node A to...

    1) (6 pts) A message M = 11101 is to be transmitted from node A to node B using CRC coding. The CRC generator polynomial is G(x) = x2 + 1. a) (2 pts) What is the derived CRC code? Perform the polynomial long division to find this result. (b) (2 pts) Suppose transmitter applies Non-Return-to-Zero Inverted (NRZI) to convert the binary stream of message along with the CRC code to the analog form. What will be the waveform? c)...

  • Consider a message D 110100111011001110111. Calculate the CRC code R for that message using a generator-polynomial...

    Consider a message D 110100111011001110111. Calculate the CRC code R for that message using a generator-polynomial x4+x+1 (CRC-4-ITU) . Represent in binary code the message to be sent (D and R). Generate 2-bit burst error (erasure error) and show the checking procedure.

  • .a) Obtain the CRC code word for the data bit sequence (10011101) using the generator 1001...

    .a) Obtain the CRC code word for the data bit sequence (10011101) using the generator 1001 .b) For the resulted codeword show the steps performed by the receiver to check message correctness

  • Obtain the 4-bit CRC code word for the data bit sequence 10011011100 (leftmost bit is the...

    Obtain the 4-bit CRC code word for the data bit sequence 10011011100 (leftmost bit is the least significant) using the generator polynomial given in the previous problem.

  • 3. We want to transmit commands to a drone over a wireless channel. The commands and...

    3. We want to transmit commands to a drone over a wireless channel. The commands and the probability of transmission are as follows: up (0.1), down (0.1), forward (0.4), left (0.15), right (0.15) and hover (0.1). (30) (a) What is a compact binary code to transmit these messages? (5) b) Suppose for hardware simplification reasons, a fixed 4-bit representation of each of the commands is used instead of the compact code. If a command is sent every second, how inefficient...

  • 6. Suppose we want an error-correcting code that will allow all single-bit errors to be corrected...

    6. Suppose we want an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 10. a) How many parity bits are necessary? b) Assuming we are using the Hamming algorithm presented in this chapter to design our error-correcting code, find the code word to represent the 10-bit information word: 1001100110

  • Write legibly to receive good rating. Consider a CRC code with a generator polynomial of g(x)...

    Write legibly to receive good rating. Consider a CRC code with a generator polynomial of g(x) -xSx21 a. (15 points) Show step by step (using the longhand division) how to find the codeword that corresponds to information bits of 10011 b. (15 points) Show the shift-register circuit that implements this CRC code. C. Suppose the codeword length is 10. Answer the following questions, with proper justifications i. (10 points) Give an example of undetectable error burst of length 9 ii....

  • Please answer this 2 part question! Please show all work (15 points) The bit stream 1110...

    Please answer this 2 part question! Please show all work (15 points) The bit stream 1110 0111 1010 is transmitted using the standard CRC algorithm described in the book. The generator polynomial is r + x + x + 1. Show the actual bit string transmitted. Suppose that the THIRTEENTH (13th) bit from the left in the transmitted message is inverted during transmission. Show that this error is detected on the receiver's end. Show every step in your calculations for...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT