Q4 - Checksum: 0 1 1 0 1 1 1 1 0 1 1 0 0 0 1 0 Assume now...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
4. A. NO. Receiver cannot absolutely sure that no bit errors have occurred. If sum of two 16 bits error integer is the same of sum of two correct integer, then you wouldn’t know if the information corrupt or missing. B. Example: Given two 16-bits integer: 1 0 1 0 1 1 0 0 1 1 0 1 1 0 0 1 1 1 1 0 0 0 1 1 1 1 0 0 0 0 1 1 Wraparound: 1 1 0 0 1 0 0 0 0 1 0 0 1 1 1 0 0 Sum: 1 0 0 1 0 0 0 0 1 0 0 1 1 1 0 1
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Checksum: 0 1 1 0 1 1 1 1 0 1 1 0 0 0 1 0 Assume now we have some errors occurred. Two 16-bits integer become: 1 0 1 0 1 1 1 1 1 1 0 1 1 0 0 1 1 1 1 0 0 0 0 0 1 1 0 0 0 0 1 1 Wraparound: 1 1 0 0 1 0 0 0 0 1 0 0 1 1 1 0 0 Sum: 1 0 0 1 0 0 0 0 1 0 0 1 1 1 0 1 So as we know if we add two 16-bits integer and we get same sum then we could not know if it contains errors bits....
View Full Document

Ask a homework question - tutors are online