Question: Knowing that some typical checksums are only 16 bits long, it appears that a corrupted data frame has a 1 in 216 chance of having
Knowing that some typical checksums are only 16 bits long, it appears that a corrupted data frame has a 1 in 216 chance of having the same checksum as its original data frame. Discuss this idea with respect to the design of checksum algorithms.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
