Number-Systems
March 24, 2024Question 11472 – APPSC-2012-DL CA
March 24, 2024Computer-Networks
|
Question 381
|
Which error detection method involves polynomials?
|
VRC
|
|
|
LRC
|
|
|
CRC
|
|
|
Checksum
|
Question 381 Explanation:
CRC error detection method involves polynomials.
The divisor in the CRC generator is most often represented not as a string of 1s and 0s, but as an algebraic polynomial. The polynomial format is used for it is short and it can be used to prove the concept mathematically. A string of 0s and 1s can be represented as a polynomial with coefficients of 0 and 1, where the power of each term in the polynomial indicates the position of the bit and the corresponding coefficient reflects the value of the bit (0 or 1).
The divisor in the CRC generator is most often represented not as a string of 1s and 0s, but as an algebraic polynomial. The polynomial format is used for it is short and it can be used to prove the concept mathematically. A string of 0s and 1s can be represented as a polynomial with coefficients of 0 and 1, where the power of each term in the polynomial indicates the position of the bit and the corresponding coefficient reflects the value of the bit (0 or 1).
Correct Answer: C
Question 381 Explanation:
CRC error detection method involves polynomials.
The divisor in the CRC generator is most often represented not as a string of 1s and 0s, but as an algebraic polynomial. The polynomial format is used for it is short and it can be used to prove the concept mathematically. A string of 0s and 1s can be represented as a polynomial with coefficients of 0 and 1, where the power of each term in the polynomial indicates the position of the bit and the corresponding coefficient reflects the value of the bit (0 or 1).
The divisor in the CRC generator is most often represented not as a string of 1s and 0s, but as an algebraic polynomial. The polynomial format is used for it is short and it can be used to prove the concept mathematically. A string of 0s and 1s can be represented as a polynomial with coefficients of 0 and 1, where the power of each term in the polynomial indicates the position of the bit and the corresponding coefficient reflects the value of the bit (0 or 1).