- #1
prashantgolu
- 50
- 0
To compute the checksum for some frame with m bits, corresponding to the polynomial M(x), the frame must be longer than the generator polynomial.
Why...?
Why...?
There's no rule that the number of data bits needs to be greater than the number of redundancy bits. You might want to check and make sure that M(x) doesn't mean an encoded message as opposed to the data portion of an encoded message.prashantgolu said:I get it...but it says that M(x) should be longer than G(x)
A checksum is a numerical value calculated from a set of data to detect errors during data transmission or storage. It is used to ensure data integrity and accuracy.
Frame length refers to the number of bits in a data frame that are used to calculate the checksum. It is important to use the correct frame length to ensure accurate error detection.
A generator polynomial is a mathematical function used in the calculation of a checksum. It is used to generate a unique checksum for each data frame, making it more difficult for errors to go undetected.
The frame length directly affects the size of the checksum. A longer frame length will result in a larger checksum, which can improve error detection but also requires more resources to calculate.
The generator polynomial plays a crucial role in the accuracy of a checksum. Choosing the wrong polynomial can result in a higher chance of undetected errors. It is important to select a polynomial that is appropriate for the specific data being transmitted or stored.