Question

Problem 8: Error Correction & Detection                                    &

Problem 8: Error Correction & Detection                                                   (6 points)

Assume a 10 by 6 array of data.

  1. How many bit errors can a 2D parity Checksum correct?
  2. How many can it detect?
  3. Compute data sent for a bit stream of 101011 with CRC using a generator 1010.
    1. What CRC bits are appended to the data.
    2. Randomly assume any bit to have been corrupted. Illustrate how the receiver can detect if the data was corrupted.

Cite your reference. You are allowed to use any online calculator for the calculations

[Good formatting, explanations and descriptions required]

0 0
Add a comment Improve this question Transcribed image text
Answer #1

8 Soin a. can correct only l-bit 2D pas Parity Transmitted data: llllO000 10101010 illi! Given that the Assume a lo by 6 Arraa How and Column must contain the incorrect bit. pascity violation will be caused by a single bit erron in one row and one coto be halue to multiply by x3 8 Delude 101011000 by 1010. 344410 -34 remainder 04 After divide value: 01000 16. minus the remCheck): widely Ar Error detection technique used Chelk (CRC) Codes interfeted as polynomial Direcvetic. CRC C Cyclic Clyelicnode d-bit piece of data, that the knows that an error has occurred otherwise the Consider the sending hode wants to send toHlee Valid code words so, thee receiver discoody for Code (0100, ull} minimum distance is 3 = Asume Mie Sender encodes the da

Add a comment
Know the answer?
Add Answer to:
Problem 8: Error Correction & Detection                                    &
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

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
  • Data Commincations: Error Detection and Correction Help understanding Excerpt: Text reads: "The Internet checksum provides greater...

    Data Commincations: Error Detection and Correction Help understanding Excerpt: Text reads: "The Internet checksum provides greater error-detection capability than a parity bit or two-dimensional parity scheme but is considerably less effective than the cyclic redundancy check (CRC), discussed next. The primary reason for its adoption in Internet protocols is efficiency. Most of these protocols are implemented in software and the Internet checksum, involving simple addition and comparison operations, causes very little overhead. It is assumed that at the lower link...

  • Given the data-bits m = 11010110 , determine the number of k (parity-bits) by using Hamming...

    Given the data-bits m = 11010110 , determine the number of k (parity-bits) by using Hamming Code requirements. Illustrate the error detection and correction scheme using Hamming code method, for both the sender and receiver to detect an error at the following positions: a. 6 th bit position . b. 11 th bit position . Assume an odd-parity scheme for this problem. You must show detailed calculations to receive full-credit.

  • 2. Design an even parity detection circuit. A parity bit is an error checking mechanism. Your...

    2. Design an even parity detection circuit. A parity bit is an error checking mechanism. Your circuit will count the number of 1's in a stream of bits. If the number of l's is even, the circuit turns on an output called y. Assume a single bit at each cycle - call the input x. Do not use an accumulator or counter. Design the even parity detection circuit using J-K flip-flops. Your answer must include: a. The state diagram. b....

  • 4/7/2015 Error Detection 4530 Error Detection Assignment Please note that you will only be able to...

    4/7/2015 Error Detection 4530 Error Detection Assignment Please note that you will only be able to submit this assignment ONCE. You need to double-check the answers that you have entered before you click the submit button It is HIGHLY recommended that you print out a copy of this page, do the assignment, filling in your answers on paper, and once you are satisfied with your results then come back to this page, type in your answers and submit. Working in...

  • 7. Show parity using odd I's with double parity, for following data 11001101110. (10 pt.) UG 8. Show the hamming code for any 6-bit data. (10pt.) 9. What are the polynomial equivalence of fol...

    7. Show parity using odd I's with double parity, for following data 11001101110. (10 pt.) UG 8. Show the hamming code for any 6-bit data. (10pt.) 9. What are the polynomial equivalence of following bits. (10 pt.) 1100101 0011101 1110001 010100 Assume a sender has the following data frames. Suppose the sender using burst error detection/correction. Show the actual row and column that is send and received. (10pt.) 1- 0110 2- 1101 3- 0011 4- 0101 11. In terms of...

  • Q1 Error detection/correction Can these schemes correct bit errors: Internet checksums, two-dimendional parity, cyclic...

    Q1 Error detection/correction Can these schemes correct bit errors: Internet checksums, two-dimendional parity, cyclic redundancy check (CRC) A. Yes, No, No B. No, Yes, Yes c. No, Yes, No D. No, No, Yes E. Ho, hum, ha Q2 CRC vs Internet checksums Which of these is not true? A. CRC's are commonly used at the link layer B. CRC's can detect any bit error of up to r bits with an r-bit EDC. c. CRC's are more resilient to bursty...

  • 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...

  • In the last module you learned a formula for calculating bit rate, R = b/t, that...

    In the last module you learned a formula for calculating bit rate, R = b/t, that is the number of bits divided by the time. This formula expresses the number of bits that are transmitted over a circuit in a given period of time. In practice, however, we are not only concerned with the number bits transmitted, but also with the number of data bits transmitted over a circuit. The data bits are those that the sender decides to send...

  • check my answers for Networking I came up with these answers, can check my answers Question...

    check my answers for Networking I came up with these answers, can check my answers Question 1: General What data rate is needed to transmit an uncompressed 4" x 6" photograph every second with a resolution of 1200 dots per inch and 24 bits per dot (pixel)? 691,200 kb/s 28.8 kb/s 8.29 Mb/s 829 Mb/s Question 2: Layering "Layering" is commonly used in computer networks because (check all that apply): -It forces all network software to be written in ‘C’....

  • Your program must meet the following specifications: 1. At program start, assume a stock of 10 nickels, 10 dimes, 10...

    Your program must meet the following specifications: 1. At program start, assume a stock of 10 nickels, 10 dimes, 10 quarters, and 10 pennies. 2. Repeatedly prompt the user for a price in the form xX.xx, where X denotes a digit, or to enter q' to quit 3. When a price is entered a. If the price entered is negative, print an error message and start over requesting either a new price or to quit (indicated by entering a 'q)...

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